Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems

Simple item page
dc.contributor.authorAravind Srinivasanen_US
dc.date.accessioned2004-10-21T14:28:52Zen_US
dc.date.accessioned2017-01-23T07:00:28Z
dc.date.available2004-10-21T14:28:52Zen_US
dc.date.available2017-01-23T07:00:28Z
dc.date.issued1997-04-01T00:00:00Zen_US
dc.description.abstractAbstract not available.en_US
dc.format.extent5709 bytesen_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.urihttps://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1328en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTRC4/97en_US
dc.titleImproved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problemsen_US
dc.typeTechnical Reporten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
filenotfound.pdf
Size:
5.58 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.52 KB
Format:
Plain Text
Description:
Download
Collections
Technical Reports