Please use this identifier to cite or link to this item:
|Title:||Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems|
|Source:||Srinivasan, 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.|
|Abstract:||We 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.|
|Source Title:||Annual Symposium on Foundations of Computer Science - Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.