1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/99534
DC FieldValue
dc.titleImproved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
dc.contributor.authorSrinivasan, Aravind
dc.date.accessioned2014-10-27T06:05:05Z
dc.date.available2014-10-27T06:05:05Z
dc.date.issued1997
dc.identifier.citationSrinivasan, Aravind (1997). Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. Annual Symposium on Foundations of Computer Science - Proceedings : 416-425. ScholarBank@NUS Repository.
dc.identifier.issn02725428
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99534
dc.description.abstractWe present improved approximation algorithms for a family of problems involving edge-disjoint paths and unsplittable flow, and for some related routing problems. The central theme of all our algorithms is the underlying multi-commodity flow relaxation.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.sourcetitleAnnual Symposium on Foundations of Computer Science - Proceedings
dc.description.page416-425
dc.description.codenASFPD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.