Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems☆
Under an Elsevier user license
open archive
Keywords
Approximation algorithms
Bounded length edge-disjoint paths
Edge-disjoint paths
Hardness of approximation
Multicommodity flow
Network routing
Unsplittable flow
Vertex-disjoint paths
Cited by (0)
- ☆
A preliminary version of this paper appeared in the Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 19–28.
- 1
Current affiliation: Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, WA 91895.
- 2
Part of this work was done when the author was visiting Bell Labs during his DIMACS postdoctoral fellowship 1997–1998.
Copyright © 2003 Elsevier Science (USA). All rights reserved.