Edge disjoint paths in moderately connected graphs

SIAM Journal on Computing

Volumn 39, Issue 5, 2010, Pages 1856-1887

  Rao, Satish ^a   Zhou, Shuheng ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

Edge disjoint paths; Polylogarithmic approximation; Random sampling in cuts

Indexed keywords

APPROXIMABILITY; CONNECTED GRAPH; DISJOINT PATHS; EDGE DISJOINT PATHS; GENERAL GRAPH; GLOBAL MINIMA; GRAPH CONNECTIVITY; GRAPH G; GRID-LIKE; NP COMPLETE PROBLEMS; PLANAR GRAPH; POLYLOGARITHMIC APPROXIMATION; RANDOM SAMPLING; SPECIAL STRUCTURE; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 77049088062     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080715093     Document Type: Article

References (35)

1. M. ANDREWS, J. CHUZHOY, S. KHANNA, AND L. ZHANG, Hardness of the undirected edge- disjoint paths problem with congestion, in Proceedings of the 46th IEEE FOCS, IEEE, Washington, DC, 2005, pp. 226-244.
2. M. Andrews and L. Zhang, Hardness of the undirected congestion minimization problem,'m Proceedings of the 37th ACM STOC, ACM, New York, 2005, pp. 284-293. (Pubitemid 43098598)
3. M. ANDREWS AND L. ZHANG, Hardness of the undirected edge-disjoint path problem,'m Proceedings of the 37th ACM STOC, ACM, New York, 2 005, pp. 276-283. (Pubitemid 43098597)
4. M. ANDREWS AND L. ZHANG, Logarithmic hardness of the directed congestion minimization problem, in Proceedings of the 38th ACM STOC, AC M, New York, 2006, pp. 517-526. (Pubitemid 44306586)
5. Y. AUmANN AND Y. RAbANi, Improved bounds for all-optical routing, in Proceedings of the 6th ACM-SIAM SODA, ACM, New York, SIAM, Philadelphia, 1995, pp. 567-576.
6. B. AWERbUcH, R. GAWlIck, F. T. LEIGHtON, AND Y. RA bANI, On-line admission control and circuit routing for high performance computing and communication, in Proceedings of the 35th IEEE FOCS, IEEE, Washington, DC, 1994, pp. 412-423.
7. A. Z. Broder, A. M. Frieze, AND E. Upfal, Existence and construction of edge-disjoint paths on expander graphs, SIAM J. Comput., 23 (1994), pp . 976-989.
8. C. Chekuri AND S. KHANNA, Edge disjoint paths revisited, in Proceedings of the 14th ACM-SIAM SODA, ACM, New York, SIAM, Philadelphia, 2003.
9. C. CHEKURI, S. KHANNA, AND F. B. SHEPHERD, The all-or-nothing multicommodity flow problem, in Proceedings of the 36th ACM STOC, ACM, New York, 2004, pp. 156-165.
10. C. CHEKURi, S. KHANNA, AND F. B. SHEPHERD, Edge-disjoint paths in planar graphs,in Proceedings of the 45th IEEE FOCS, IEEE, Washington, DC, 2004, pp. 71-80.
11. C. CHEKURi, S. KHANNA, AND F. B. SHEPHERD, Multicommodity flow, well-linked terminals, and routing problems, in Proceedings of the 37th ACM STOC, ACM, New York, 2005, pp. 183-192.
12. C. CHEKURi, S. KHANNA, AND F. B. SHEPHERD, Edge-disjoint paths in planar graphs with constant congestion, in Proceedings of the 38th ACM STOC, ACM, New York, 2006, pp. 757-766.
13. C. CHEKURI, S. KHANNA, AND F. B. SHEPHERD, An 0(n) approximation and integrality gap for disjoint paths and unsplittable flow, J. Theory Comput., 2 (2006), pp. 137-146.
14. H. CHERNOFF, A measure of asymptotic efficiency of tests of a hypothesis based on the sum of observations, Ann. Math. Statistics, 23 (1952), pp. 493-507.
15. J. Chuzhoy, V. GURUSWAMi, S. KHANNA, AND K. TALWAR, Hardness of routing with congestion in directed graphs, in Proceedings of the 39th ACM STOC, ACM, New York, 2007, pp. 165-178.
16. J. CHUZHOY AND J. NAOR, New hardness results for congestion minimization and machine scheduling, in Proceedings of the 36th ACM STOC, ACM, New York, 2004, pp. 28-34.
17. N. GARG, V. V. VAZIRANI, AND M. YANNAKAKIS, Primal-dual approximation algorithms for integral flow and multicut in trees, in Proceedings of the 20th ICALP, Springer-Verlag, London, 1993, pp. 64-75.
18. N. GARG, V. V. VAZIRANI, AND M. YANNAKAKIS, Approximate max-flow min-(multi)cut theorems and their applications, SIAM J. Comput., 25 (1996), pp. 235-251.
19. V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, and M. Yannakakis, Near- optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, in Proceedings of the 31th ACM STOC, ACM, New York, 1999, pp. 19-28.
20. D. R. KARGER, Random sampling in cut, flow, and network design problems, in Proceedings of the 26th ACM STOC, ACM, New York, 1994, pp. 648-657.
21. D. R. KARGER Random sampling in cut, flow, and network design problems, Math. Oper. Res., 24 (1999), pp. 383-413.
22. R. KHANDEKAR, S. Rao, AND U. VAZiRANi, Graph partitioning using single commodity flows, in Proceedings of the 38th ACM STOC, ACM, New York, 2006, pp. 385-390.
23. J. KLEINBERG, An approximation algorithm for the disjoint paths problem in even-degree planar graphs, in Proceedings of the 46th IEEE FOCS, IEEE, Washington, DC, 2005, pp. 627-636.
24. J. Kleinberg AND R. Rubinfeld, Short paths in expander graphs, in Proceedings of the 37th IEEE FOCS, IEEE, Washington, DC, 1996, p. 86.
25. J. KLEiNBERG AND E. TARDOS, Approximations for the disjoint paths problem in high-diameter planar networks, in Proceedings of the 27th ACM STO C, ACM, New York, 1995, pp. 26-35.
26. J. KLEiNBERG AND E. TARDOS, Disjoint paths in densely embedded graphs, in Proceedings of the 36th IEEE FOCS, IEEE, Washington, DC, 1995, pp. 52-61.
27. J. M. KLEiNBERG, Approximation Algorithms for Disjoint Paths Problems,Ph.D. thesis, MIT, Cambridge, MA, 1996.
28. S. G. KOLLiOPOULOS AND C. Stein, Approximating disjoint-path problems using greedy algorithms and packing integer programs, in Proceedings of IPCO, Springer-Verlag, London, 1998, pp. 153-168.
29. P. KOLMAN AND C. ScHEiDELER, Simple on-line algorithms for the maximum disjoint paths problem, in Proceedings of the 13th ACM SPAA, ACM, New York, 2001, pp. 38-47.
30. K. Obata, Approximate max-integral-flow/min-multicut theorems, in Proceedings of the 36th ACM STOC, ACM, New York, 2004, pp. 539-545.
31. L. Orecchia, L. ScHULMAN, U. VAZiRANi, AND N. ViSHNOi, On partitioning graphs via single commodity flows, in Proceedings of the 40th ACM STOC, ACM, New York, 2008, pp. 461-470.
32. P. Raghavan AND C. D. THOMPSON, Randomized roundings: A technique for provably good algorithms and algorithms proofs, Combinatorica, 7 (1987), pp. 365-374.
33. N. RObERtSON AND P. D. SEYmOUR, An outline of a disjo int paths algorithm,inPaths,Flows and VLSI-layout, Algorithms Combin. 9, Springer-Verlag, Berlin, 1990, pp. 267-292.
34. A. SRINivASAN, Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems, in Proceedings of the 38th IEEE FOCS, IEEE, Washington, DC, 1997, p. 416.
35. K. VARADARAjAN AND G. VENkAtARAmAN, Graph decomposition and a greedy algorithm for edge-disjoint paths, in Proceedings of the ACM-SIAM SODA, ACM, New York, SIAM, Philadelphia, 2004, pp. 379-380.