Hardness of the undirected edge-disjoint paths problem with congestion

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

Volumn 2005, Issue , 2005, Pages 226-241

  Andrews, Matthew ^a   Chuzhoy, Julia ^b   Khanna, Sanjeev ^c   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALL OR NOTHING FLOW (ANF); EDGE DISJOINT PATHS (EDP); EDGE-DISJOINT PATHS PROBLEM WITH CONGESTION (EDPWC); POLYLOGARITHMIC INTEGRALITY GAPS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGER PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

CONGESTION CONTROL (COMMUNICATION);

EID: 33748628834     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.41     Document Type: Conference Paper

References (34)

1. M. Andrews and L. Zhang. Hardness of the undirected edge-disjoint paths problem. Proc. of STOC, 2005.
2. M. Andrews and L. Zhang. Hardness of the undirected congestion minimization problem. Proc. of STOC, 2005.
3. M. Andrews and L. Zhang. Hardness of the edge-disjoint paths problem with congestion. http://cm.bell-labs.com/~andrews/pub.html, 2005.
4. Y. Aumann and Y. Rabani. An O(log K) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291-301, February 1998.
5. Y. Azar and O. Regev. Strongly Polynomial Algorithms for the Unsplittable Flow Problem. IPCO 2001: 15-29.
6. A. Baveja and A. Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research, Vol. 25, pp. 255-280, 2000.
7. C. Chekuri, S. Khanna, and F. B. Shepherd. The All-or-Nothing Multi-commodity Flow Problem. Proc. of STOC, June 2004.
8. C. Chekuri, S. Khanna, and F. B. Shepherd. Edge Disjoint Paths in Planar Graphs. Proc. of FOCS, 2004.
9. C. Chekuri, S. Khanna, and F. B. Shepherd. Multicommodity Flow, Well-linked Terminals, and Routing Problems Proc. of STOC, 2005.
10. C. Chekuri, S. Khanna, and F. B. Shepherd. An O(√n)-approximation for EDP in Undirected Graphs and Directed Acyclic Graphs. Manuscript, 2005.
11. C. Chekuri and S. Khanna. Edge Disjoint Paths Revisited. Proc. of SODA, 2003.
12. C. Chekuri, M. Mydlarz, and F. B. Shepherd. Multicommodity Demand Flow in a Tree and Packing Integer Programs. Submitted. Preliminary version in Proc. of ICALP, 2003.
13. J. Chuzhoy and S. Khanna. New hardness results for undirected edge disjoint paths, http://www.cis.upenn.edu/~sanjeev/postscript/edpwc.ps.gz 2005.
14. 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.
15. A. Frank. Edge-disjoint paths in planar graphs. J. of Combinatorial Theory, Ser. B., No. 2 (1985), 164-178.
16. S. Fortune, J. Hopcroft and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, Vol. 10, No. 2 (1980), pp. 111-121.
17. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
18. N. Garg, V. Vazirani, M. Yannakakis. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica, 18(1):3-20, 1997.
19. Preliminary version appeared in Proc. of ICALP, 1993.
20. 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. To appear in JCSS.
21. Preliminary version appeared in Proc. of STOC, 1999.
22. V. Guruswami and K. Talwar. Hardness of low congestion routing in undirected graphs. Manuscript, 2005.
23. J. Hastad, A. Wigderson. Simple Analysis of Graph Tests for Linearity and PCP. Random Structures and Algorithms, Vol 22, no. 2, pp 139-160, 2003.
24. J. M. Kleinberg and É. Tardos. Approximations for the disjoint paths problem in high-diameter planar networks. Journal of Computer and System Sciences, 57:61-73, 1998.
25. Preliminary version in the Proc. of STOC, 1995.
26. J. M. Kleinberg and É. Tardos. Disjoint Paths in Densely Embedded Graphs. Proc. of FOCS, pp. 52-61, 1995.
27. J. M. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA, May 1996.
28. S. G. Kolliopoulos and C. Stein. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. IPCO 1998: 153-168.
29. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica,7:365-374, 1987.
30. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.
31. N. Robertson and P. D. Seymour. Outline of a disjoint paths algorithm. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, Eds., Paths, Flows and VLSI-Layout. Springer-Verlag, Berlin, 1990.
32. 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.
33. A. Srinivasan. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. Proc. of the FOCS, pp. 416-425, 1997.
34. K. Varadarajan and G. Venkataraman. Graph Decomposition and a Greedy Algorithm for Edge-disjoint Paths. Proc. of SODA, 2004.