@conference {17607, title = {Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems}, booktitle = {, 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings}, year = {1997}, month = {1997/10/20/22}, pages = {416 - 425}, publisher = {IEEE}, organization = {IEEE}, 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}, keywords = {Approximation algorithms, Bandwidth, Channel allocation, computational complexity, Computer science, edge-disjoint paths, graph theory, High speed integrated circuits, IEL, Image motion analysis, Information systems, multi-commodity flow relaxation, Multiprocessor interconnection networks, network routing, Optical fiber networks, Routing, routing problems, unsplittable flow}, isbn = {0-8186-8197-7}, doi = {10.1109/SFCS.1997.646130}, author = {Srinivasan, Aravind} }