A polylogarithmic approximation algorithm for edge-disjoint paths with congestion 2

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 233-242

  Chuzhoy, Julia ^a   Li, Shi ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b Princeton University   (United States)

Author keywords

approximation algorithms; edge disjoint paths; network routing

Indexed keywords

BEST APPROXIMATIONS; CONGESTION PROBLEM; EDGE CONGESTION; EDGE-DISJOINT PATHS; INTEGRALITY GAPS; LOWER BOUNDS; MULTI-COMMODITY FLOW; N-VERTEX GRAPH; POLYLOGARITHMIC APPROXIMATION;

COMPUTER SCIENCE; GRAPH THEORY; NETWORK ROUTING; POLYNOMIAL APPROXIMATION; TRAFFIC CONGESTION;

APPROXIMATION ALGORITHMS;

EID: 84871970528     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.54     Document Type: Conference Paper

References (24)

1. N. Robertson and P. D. Seymour, "Outline of a disjoint paths algorithm," in Paths, Flows and VLSI-Layout. Springer-Verlag, 1990.
2. R. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. Miller and J. Thatcher, Eds. Plenum Press, 1972, pp. 85-103.
3. C. Chekuri, S. Khanna, and F. B. Shepherd, "An O(√n) approximation and integrality gap for disjoint paths and unsplittable flow," Theory of Computing, vol. 2, no. 1, pp. 137-146, 2006.
4. N. Garg, V. V. Vazirani, and M. Yannakakis, "Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover," in ICALP, ser. Lecture Notes in Computer Science, A. Lingas, R. G. Karlsson, and S. Carlsson, Eds., vol. 700. Springer, 1993, pp. 64-75.
5. M. Andrews and L. Zhang, "Hardness of the undirected edge-disjoint paths problem," in STOC, H. N. Gabow and R. Fagin, Eds. ACM, 2005, pp. 276-283.
6. M. Andrews, J. Chuzhoy, V. Guruswami, S. Khanna, K. Talwar, and L. Zhang, "Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs," Combinatorica, vol. 30, no. 5, pp. 485-520, 2010.
7. P. Raghavan and C. D. Tompson, "Randomized rounding: a technique for provably good algorithms and algorithmic proofs," Combinatorica, vol. 7, pp. 365-374, December 1987. [Online]. Available: http://portal.acm.org/citation. cfm?id=45291.45296
8. Y. Azar and O. Regev, "Strongly polynomial algorithms for the unsplittable flow problem," in In Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2001, pp. 15-29.
9. A. Baveja and A. Srinivasan, "Approximation algorithms for disjoint paths and related routing and packing problems," Mathematics of Operations Research, vol. 25, p. 2000, 2000.
10. S. G. Kolliopoulos and C. Stein, "Approximating disjoint-path problems using packing integer programs," Mathematical Programming, vol. 99, pp. 63-87, 2004.
11. M. Andrews, "Approximation algorithms for the edge-disjoint paths problem via Raecke decompositions," in Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 2010, pp. 277-286.
12. J. Chuzhoy, "Routing in undirected graphs with constant congestion," in Proceedings of the 44th symposium on Theory of Computing, 2012, pp. 855-874.
13. 1/2)- approximation algorithms for the edge-disjoint paths problem with congestion two," in STOC, L. Fortnow and S. P. Vadhan, Eds. ACM, 2011, pp. 81-88.
14. C. Chekuri, S. Khanna, and F. B. Shepherd, "Multicommodity flow, well-linked terminals, and routing problems," in STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 2005, pp. 183-192.
15. S. Rao and S. Zhou, "Edge disjoint paths in moderately connected graphs," SIAM J. Comput., vol. 39, no. 5, pp. 1856-1887, 2010.
16. C. Chekuri, S. Khanna, and F. B. Shepherd, "The all-ornothing multicommodity flow problem," in STOC, L. Babai, Ed. ACM, 2004, pp. 156-165, a full version at http://www.math.mcgill.ca/~bshepherd/PS/all.pdf.
17. S. Arora, S. Rao, and U. V. Vazirani, "Expander flows, geometric embeddings and graph partitioning," J. ACM, vol. 56, no. 2, 2009.
18. F. T. Leighton and S. Rao, "Multicommodity max-flow mincut theorems and their use in designing approximation algorithms," Journal of the ACM, vol. 46, pp. 787-832, 1999.
19. N. Garg, V. Vazirani, and M. Yannakakis, "Approximate maxflow min-(multi)-cut theorems and their applications," SIAM Journal on Computing, vol. 25, pp. 235-251, 1995.
20. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Proceedings of 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 577-591, 1994.
21. Y. Aumann and Y. Rabani, "An O(log k) approximate mincut max-flow theorem and approximation algorithm," SIAM J. Comput., vol. 27, no. 1, pp. 291-301, 1998.
22. R. Khandekar, S. Rao, and U. V. Vazirani, "Graph partitioning using single commodity flows," in STOC, J. M. Kleinberg, Ed. ACM, 2006, pp. 385-390.
23. L. Orecchia, L. J. Schulman, U. V. Vazirani, and N. K. Vishnoi, "On partitioning graphs via single commodity flows," in Proceedings of the 40th annual ACM symposium on Theory of computing, ser. STOC '08. New York, NY, USA: ACM, 2008, pp. 461-470. [Online]. Available: http://doi.acm.org/10.1145/1374376. 1374442
24. C. Chekuri, S. Khanna, and F. B. Shepherd, "Edge-disjoint paths in planar graphs," in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, ser. FOCS '04. Washington, DC, USA: IEEE Computer Society, 2004, pp. 71-80.