%0 Conference Paper
%B , 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings
%D 1997
%T Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
%A Srinivasan, Aravind
%K Approximation algorithms
%K Bandwidth
%K Channel allocation
%K computational complexity
%K Computer science
%K edge-disjoint paths
%K graph theory
%K High speed integrated circuits
%K IEL
%K Image motion analysis
%K Information systems
%K multi-commodity flow relaxation
%K Multiprocessor interconnection networks
%K network routing
%K Optical fiber networks
%K Routing
%K routing problems
%K unsplittable flow
%X 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
%B , 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings
%I IEEE
%P 416 - 425
%8 1997/10/20/22
%@ 0-8186-8197-7
%G eng
%R 10.1109/SFCS.1997.646130