Routing in undirected graphs with constant congestion

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 855-874

  Chuzhoy, Julia ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

approximation algorithms; edge disjoint paths; network routing

Indexed keywords

CONGESTION PROBLEM; EDGE CONGESTION; EDGE-DISJOINT PATHS; MAXIMUM LOAD; RANDOMIZED ALGORITHMS; ROUTINGS; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; NETWORK ROUTING;

TRAFFIC CONGESTION;

EID: 84862602684     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214054     Document Type: Conference Paper

References (53)

1. Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, and Lisa Zhang. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica, 30(5):485-520, 2010.
2. Matthew 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, FOCS '10, pages 277-286, Washington, DC, USA, 2010. IEEE Computer Society.
3. Yonatan Aumann and Yuval Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301, 1998.
4. Yossi Azar and Oded Regev. Strongly polynomial algorithms for the unsplittable flow problem. In In Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 15-29, 2001.
5. Sanjeev Arora, Satish Rao, and Umesh V. Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2), 2009.
6. Matthew Andrews and Lisa Zhang. Hardness of the undirected edge-disjoint paths problem. In Harold N. Gabow and Ronald Fagin, editors, STOC, pages 276-283. ACM, 2005.
7. Matthew Andrews and Lisa Zhang. Hardness of the undirected congestion minimization problem. SIAM J. Comput., 37(1):112-131, 2007.
8. Matthew Andrews and Lisa Zhang. Almost-tight hardness of directed congestion minimization. J. ACM, 55(6), 2008.
9. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, and Eli Upfal. Optimal construction of edge-disjoint paths in random graphs. In Proc. 5th ACM-SIAM SODA, pages 603-612, 1994.
10. Andrei Z. Broder, Alan M. Frieze, and Eli Upfal. Existence and construction of edge-disjoint paths on expander graphs. SIAM J. Comput., pages 976-989, 1994.
11. Alok Baveja and Aravind Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research, 25:2000, 2000.
12. Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, and Kunal Talwar. Hardness of routing with congestion in directed graphs. In ACM Symposium on Theory of Computing, pages 165-178, 2007.
13. Chandra Chekuri and Sanjeev Khanna. Edge disjoint paths revisited. In Symposium on Discrete Algorithms, pages 628-637, 2003.
14. Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. The all-or-nothing multicommodity flow problem. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, STOC '04, pages 156-165, New York, NY, USA, 2004. ACM.
15. Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. Multicommodity flow, well-linked terminals, and routing problems. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 183-192, New York, NY, USA, 2005. ACM.
16. Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. Edge-disjoint paths in planar graphs with constant congestion. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, STOC '06, pages 757-766, New York, NY, USA, 2006. ACM.
17. Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd. An O(√n) approximation and integrality gap for disjoint paths and unsplittable flow. Theory of Computing, 2(1):137-146, 2006.
18. Moses Charikar, Tom Leighton, Shi Li, and Ankur Moitra. Vertex sparsifiers and abstract rounding algorithms. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS '10, pages 265-274, Washington, DC, USA, 2010. IEEE Computer Society.
19. Chandra Chekuri, Marcelo Mydlarz, and F. Bruce Shepherd. Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Algorithms, 3, August 2007.
20. Devdatt Dubhashi and Alessandro Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, New York, NY, USA, 1st edition, 2009.
21. Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, and Kunal Talwar. Vertex sparsifiers: new results from old techniques. In Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques, APPROX/RANDOM'10, pages 152-165, Berlin, Heidelberg, 2010. Springer-Verlag.
22. A. Frank. Edge-disjoint paths in planar graphs. Journal of Combinatorial Theory, 39:164-178, 1985.
23. A. Frank. On connectivity properties of Eulerian digraphs. Ann. Discrete Math., 41, 1989.
24. Alan M. Frieze. Edge-disjoint paths in expander graphs. SIAM Journal On Computing, 30:2001, 2000.
25. Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, Bruce Shepherd, and Mihalis Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Journal of Computer and System Sciences, page pages, 1999.
26. N. Garg, V.V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)-cut theorems and their applications. SIAM Journal on Computing, 25:235-251, 1995. (Pubitemid 126577270)
27. Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18(1):3-20, 1997.
28. A. Hajnal and E. Szemerédi. Proof of a conjecture of P. Erdos. Combinatorial Theory and its Applications, pages 601-623, 1970.
29. Bill Jackson. Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs. J. Graph Theory, 12:429-436, 1998.
30. R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
31. Ken-ichi Kawarabayashi and Yusuke Kobayashi. An O(log n)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs. In APPROX-RANDOM'10, pages 274-286, 2010.
32. Ken-ichi Kawarabayashi and Yusuke Kobayashi. Breaking O(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. In Lance Fortnow and Salil P. Vadhan, editors, STOC, pages 81-88. ACM, 2011.
33. Jon Kleinberg. Approximation algorithms for disjoint paths problems, 1996.
34. Jon M. Kleinberg. An approximation algorithm for the disjoint paths problem in even-degree planar graphs. In FOCS'05, pages 627-636, 2005.
35. Jon Kleinberg and Ronitt Rubinfeld. Short paths in expander graphs. In In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 86-95, 1996.
36. Rohit Khandekar, Satish Rao, and Umesh V. Vazirani. Graph partitioning using single commodity flows. In Jon M. Kleinberg, editor, STOC, pages 385-390. ACM, 2006.
37. Stavros G. Kolliopoulos and Clifford Stein. Approximating disjoint-path problems using packing integer programs. Mathematical Programming, 99:63-87, 2004.
38. Jon Kleinberg and Evá Tardos. Approximations for the disjoint paths problem in high-diameter planar networks. In ACM Symposium on Theory of Computing, pages 26-35, 1995.
39. 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, pages 577-591, 1994.
40. F. Thomson Leighton and Ankur Moitra. Extensions and limits to vertex sparsification. In Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pages 47-56, New York, NY, USA, 2010. ACM.
41. F. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46:787-832, 1999.
42. W. Mader. A reduction method for edge connectivity in graphs. Ann. Discrete Math., 3:145-164, 1978.
43. Konstantin Makarychev and Yury Makarychev. Metric extension operators, vertex sparsifiers and lipschitz extendability. In FOCS, pages 255-264. IEEE Computer Society, 2010.
44. Ankur Moitra. Approximation algorithms for multicommodity-type problems with guarantees independent of the graph size. In FOCS, pages 3-12. IEEE Computer Society, 2009.
45. Robin A. Moser and Gábor Tardos. A constructive proof of the general lovász local lemma. J. ACM, 57:11:1-11:15, February 2010.
46. Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, and Nisheeth K. Vishnoi. On partitioning graphs via single commodity flows. In Proceedings of the 40th annual ACM symposium on Theory of computing, STOC '08, pages 461-470, New York, NY, USA, 2008. ACM.
47. Harald Räcke. Minimizing congestion in general networks. In In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 43-52, 2002.
48. N. Robertson and P. D. Seymour. Outline of a disjoint paths algorithm. In Paths, Flows and VLSI-Layout. Springer-Verlag, 1990.
49. Prabhakar Raghavan and Clark D. Tompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, December 1987.
50. Satish Rao and Shuheng Zhou. Edge disjoint paths in moderately connected graphs. SIAM J. Comput., 39(5):1856-1887, 2010.
51. Mohit Singh and Lap Chi Lau. Approximating minimum bounded degree spanning trees to within one of optimal. In David S. Johnson and Uriel Feige, editors, STOC, pages 661-670. ACM, 2007.
52. Aravind Srinivasan. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In IEEE Symposium on Foundations of Computer Science, pages 416-425, 1997.
53. Kasturi R. Varadarajan and Ganesh Venkataraman. Graph decomposition and a greedy algorithm for edge-disjoint paths. In Symposium on Discrete Algorithms, pages 379-380, 2004.