Collision-free routing problem with restricted L-path

Simple item page
dc.contributor.authorKumar, Jammigumpula Ajay
dc.date.accessioned2018-08-03T05:41:27Z
dc.date.available2018-08-03T05:41:27Z
dc.date.issued2018
dc.descriptionDissertation under the supervision of Dr. Sasanka Roy, ACM Uniten_US
dc.identifier.citation38p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/6963
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;18-397
dc.subjectMaximum independent seten_US
dc.subjectGraphsen_US
dc.subjectApproximation algorithmen_US
dc.subjectCollision-freeen_US
dc.subjectCo-comparable graphen_US
dc.titleCollision-free routing problem with restricted L-pathen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Diss-397.pdf
Size:
435.88 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Dissertations - M Tech (CS)