Hardness of the undirected Edge-Disjoint Paths Problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 276-283

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Edge disjoint paths; Hardness of approximation; Undirected graphs

Indexed keywords

EDGE-DISJOINT PATHS; HARDNESS OF APPROXIMATION; UNDIRECTED GRAPHS;

APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING;

COMPUTATIONAL COMPLEXITY;

EID: 34848834854     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060632     Document Type: Conference Paper

References (23)

1. M. Andrews. Hardness of buy-at-bulk network design. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pages 115-124, Rome, Italy, October 2004.
2. Y. Aumann and Y. Rabani. Improved bounds for all optical routing. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 567-576, 1995.
3. A. Baveja and A. Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research, 25:255-280, 2000.
4. C. Chekuri and S. Khanna. Edge-disjoint paths revisited. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
5. C. Chekuri, S. Khanna, and F.B. Shepherd. The all-or-nothing multi-commodity flow problem. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004.
6. Y. Dinitz, N. Garg, and M. Goemans. On the single source unsplittable flow problem. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 290-299, Palo Alto, CA, November 1998.
7. P. Erdös and H. Sachs. Reguläre graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Uni. Halle-Wittenburg (Math. Nat.), 12:251-257, 1963.
8. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268-292, 1996.
9. N. Garg, V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18:3-20, 1997.
10. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Proceedings of the 31st Annual ACM Symposium of Theory of Computing, pages 19-28, Atlanta, GA, May 1999.
11. J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA, May 1996.
12. J. Kleinberg. Single-source unsplittable flow. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 68-77, Burlington, VT, October 1996.
13. J. Kleinberg. Decision algorithms for unsplittable flow and the half-disjoint paths problem. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 530-539, Dallas, TX, May 1998.
14. J. Kleinberg and E. Tardos. Approximations for the disjoint paths problem in high-diameter planar networks. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 26-35, 1995.
15. J. Kleinberg and E. Tardos. Disjoint paths in densely embedded graphs. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 52-61, 1995.
16. S. Kolliopoulos and C. Stein. Improved approximation algorithms for unsplittable flow problems. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 426-435, Miami Beach, FL, October 1997.
17. S. Kolliopoulos and C. Stein. Approximating disjoint-path problems using greedy algorithms and packet integer programs. In Integer Programming and Combinatorial Optimization, 1998.
18. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422-431, 1988.
19. B. Ma and L. Wang. On the inapproximability of disjoint paths and minimum steiner forest with bandwidth constraints. Journal of Computer and System Sciences, 60:1-12, 2000.
20. A. Samorodnitsky and L. Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000.
21. A. Srinivasan. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 416-425, Miami Beach, FL, October 1997.
22. L. Trevisan. Non-approximability results for optimization problems on bounded degree instances. In Proceedings of the 33rd Annual ACM Symposium of Theory of Computing, 2001.
23. K. Varadarajan and G. Venkataraman. Graph decomposition and a greedy algorithm for edge-disjoint paths. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004.