article

Logarithmic hardness of the undirected edge-disjoint paths problem

Authors:

Matthew Andrews,

Lisa ZhangAuthors Info & Claims

Journal of the ACM (JACM), Volume 53, Issue 5

Pages 745 - 761

https://doi.org/10.1145/1183907.1183910

Published: 01 September 2006 Publication History

Abstract

We show that there is no log^{⅓ − ε} M approximation for the undirected Edge-Disjoint Paths problem unless NP ⊆ ZPTIME(n^polylog(n)), where M is the size of the graph and ε is any positive constant. This hardness result also applies to the undirected All-or-Nothing Multicommodity Flow problem and the undirected Node-Disjoint Paths problem.

References

[1]

Andrews, M. 2004. Hardness of buy-at-bulk network design. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science (Rome, Italy, Oct.). IEEE Computer Society Press, Los Alamitos, CA, 115--124.]]

Digital Library

[2]

Andrews, M., Chuzhoy, J., Khanna, S., and Zhang, L. 2005. Hardness of the undirected edge-disjoint paths problem with congestion. In Proceedings of the 46th Annual Symposium on Foundations of Computer Science (Pittsburgh, PA, Oct). IEEE Computer Society Press, Los Alamitos, CA.]]

Digital Library

[3]

Andrews, M., and Zhang, L. 2005a. Hardness of the undirected congestion minimization problem. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (Baltimore, MD, May). ACM, New York.]]

Digital Library

[4]

Andrews, M., and Zhang, L. 2005b. Hardness of the undirected edge-disjoint paths problem. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (Baltimore, MD, May). ACM, New York.]]

Digital Library

[5]

Andrews, M., and Zhang, L. 2006. Logarithmic hardness of the directed congestion minimization problem. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (Seattle, WA.). ACM, New York.]]

Digital Library

[6]

Aumann, Y., and Rabani, Y. 1995. Improved bounds for all optical routing. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms ACM, New York. 567--576.]]

Digital Library

[7]

Azar, Y., and Regev, O. 2001. Strongly polynomial algorithms for the unsplittable flow problem. In Integer Programming and Combinatorial Optimization. PP. 15--29.]]

Digital Library

[8]

Baveja, A., and Srinivasan, A. 2000. Approximation algorithms for disjoint paths and related routing and packing problems. Math. Oper. Res. 25, 255--280.]]

Digital Library

[9]

Chekuri, C., and Khanna, S. 2003. Edge-disjoint paths revisited. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York.]]

Digital Library

[10]

Chekuri, C., Khanna, S., and Shepherd, F. B. 2004. The all-or-nothing multi-commodity flow problem. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing. ACM, New York.]]

Digital Library

[11]

Chekuri, C., Khanna, S., and Shepherd, B. 2006a. Edge-disjoint paths in planar graphs with constant congestion. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (Seattle, WA), ACM, New York.]]

Digital Library

[12]

Chekuri, C., Khanna, S., and Shepherd, B. 2006b. An O(&nradic;) approximation and integrality gap for disjoint paths and UFP. Theory Comput. 2, 137--146.]]

[13]

Dinitz, Y., Garg, N., and Goemans, M. 1999. On the single source unsplittable flow problem. Combinatorica 19, 1, 17--41,]]

[14]

Erdös, P., and Sachs, H. 1963. Reguläre graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Uni. Halle-Wittenburg (Math. Nat.) 12, 251--257.]]

[15]

Feige, U., Goldwasser, S., Lovász, L. Safra, S., and Szegedy, M. 1996. Interactive proofs and the hardness of approximating cliques. Journal of the ACM 43, 2, 268--292.]]

Digital Library

[16]

Fortune, S., Hopcroft, J., and Wyllie, J. 1980. The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 2, 111--121.]]

[17]

Garg, N., Vazirani, V., and Yannakakis, M. 1997. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3--20,]]

Digital Library

[18]

Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., and Yannakakis, M. 2003. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67, 3, 473--496.]]

Digital Library

[19]

Karp, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds, pp. 85--103.]]

[20]

Kleinberg, J. 1996. Approximation Algorithms for Disjoint Paths Problems. Ph.D. dissertation, MIT, Cambridge, MA, May.]]

Digital Library

[21]

Kleinberg, J. 1996. Single-source unsplittable flow. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (Burlington, VT, Oct.). IEEE Computer Society Press, Los Alamitos, CA, pp. 68--77.]]

Digital Library

[22]

Kleinberg, J. 1998. Decision algorithms for unsplittable flow and the half-disjoint paths problem. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (Dallas, TX, May). ACM, New York, pp. 530--539.]]

Digital Library

[23]

Kleinberg, J., and Tardos, E. 1995. Disjoint paths in densely embedded graphs. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, pp. 52--61.]]

Digital Library

[24]

Kleinberg, J., and Tardos, E. 1998. Approximations for the disjoint paths problem in high-diameter planar networks. J. Comput. Syst. Sci. 57, 1, 61--73.]]

Digital Library

[25]

Kolliopoulos, S., and Stein, C. 1997. Improved approximation algorithms for unsplittable flow problems. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (Miami Beach, FL, Oct.). IEEE Computer Society Press, Los Alamitos, CA, pp. 426--435.]]

Digital Library

[26]

Kolliopoulos, S., and Stein, C. 1998. Approximating disjoint-path problems using greedy algorithms and packet integer programs. In Integer Programming and Combinatorial Optimization.]]

[27]

Leighton, T., and Rao, S. 1999. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 6, 787--832.]]

Digital Library

[28]

Ma, B., and Wang, L. 2000. On the inapproximability of disjoint paths and minimum steiner forest with bandwidth constraints. J. Comput. Syst. Sci. 60, 1--12.]]

Digital Library

[29]

Raghavan, P., and Thompson, C. D. 1991. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365--374.]]

Digital Library

[30]

Robertson, N., and Seymour, P. D. 1990. Outline of a disjoint paths algorithm. In Paths, Flows and VLSI-Layout, B. Korte, L. Lovász, H. J. Prömel and A. Schrijver, Eds. Springer-Verlag, New York.]]

[31]

Samorodnitsky, A., and Trevisan, L. 2000. A PCP characterization of NP with optimal amortized query complexity. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York.]]

Digital Library

[32]

Srinivasan, A. 1997. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (Miami Beach, FL, Oct.). IEEE Computer Society Press, Los Alamitos, CA, pp. 416--425.]]

Digital Library

[33]

Trevisan, L. 2001. Non-approximability results for optimization problems on bounded degree instances. In Proceedings of the 33rd Annual ACM Symposium of Theory of Computing. ACM, New York.]]

Digital Library

[34]

Varadarajan, K., and Venkataraman, G. 2004. Graph decomposition and a greedy algorithm for edge-disjoint paths. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York.]]

Digital Library

Cited By

Lachney MYadav A(2020)Computing and community in formal educationCommunications of the ACM10.1145/337991863:3(18-21)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3379918
Kienzle JMussbacher GCombemale BBastin LBencomo NBruel JBecker CBetz SChitchyan RCheng BKlingert SPaige RPenzenstadler BSeyff NSyriani EVenters C(2020)Toward model-driven sustainability evaluationCommunications of the ACM10.1145/337190663:3(80-91)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3371906
Awad EDsouza SBonnefon JShariff ARahwan I(2020)Crowdsourcing moral machinesCommunications of the ACM10.1145/333990463:3(48-55)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3339904
Show More Cited By

Index Terms

Logarithmic hardness of the undirected edge-disjoint paths problem
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Hardness of the undirected edge-disjoint paths problem
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

We show that there is no log ^{1 over 3-ε} M approximation for the undirected Edge-Disjoint Paths problem unless NP ⊆ ZPTIME(n^polylog(n), where M is the size of the graph and ε is any positive constant. This hardness result also applies to the undirected ...
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs (s_i, t_i), 1 ≤i≤k, and the goal is to find a largest subset of source-sink pairs that can ...
New hardness results for routing on disjoint paths
STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing

In the classical Node-Disjoint Paths (NDP) problem, the input consists of an undirected n-vertex graph G, and a collection M={(s₁,t₁),…,(s_k,t_k)} of pairs of its vertices, called source-destination, or demand, pairs. The goal is to route the largest ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 53, Issue 5

September 2006

173 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/1183907

Issue’s Table of Contents

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 2006

Published in JACM Volume 53, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
589
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lachney MYadav A(2020)Computing and community in formal educationCommunications of the ACM10.1145/337991863:3(18-21)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3379918
Kienzle JMussbacher GCombemale BBastin LBencomo NBruel JBecker CBetz SChitchyan RCheng BKlingert SPaige RPenzenstadler BSeyff NSyriani EVenters C(2020)Toward model-driven sustainability evaluationCommunications of the ACM10.1145/337190663:3(80-91)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3371906
Awad EDsouza SBonnefon JShariff ARahwan I(2020)Crowdsourcing moral machinesCommunications of the ACM10.1145/333990463:3(48-55)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3339904
Fried OJacobs JFinkelstein AAgrawala M(2020)Editing self-imageCommunications of the ACM10.1145/332660163:3(70-79)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3326601
Liu ZXia YLiu QHe QZhang CZimmermann R(2018)Toward Personalized Activity Level Prediction in Community Question Answering WebsitesACM Transactions on Multimedia Computing, Communications, and Applications10.1145/318701114:2s(1-15)Online publication date: 25-Apr-2018
https://dl.acm.org/doi/10.1145/3187011
Hassan MDaiber FWiehr FKosmalla FKrüger A(2017)FootStrikerProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/30533321:1(1-18)Online publication date: 30-Mar-2017
https://dl.acm.org/doi/10.1145/3053332
Dementyev AHolz C(2017)DualBlinkProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/30533301:1(1-19)Online publication date: 30-Mar-2017
https://dl.acm.org/doi/10.1145/3053330
Guruswami VLee E(2017)Inapproximability of $H$-Transversal/PackingSIAM Journal on Discrete Mathematics10.1137/16M107067031:3(1552-1571)Online publication date: 26-Jul-2017
https://doi.org/10.1137/16M1070670
Chuzhoy JLi S(2016)A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2Journal of the ACM10.1145/289347263:5(1-51)Online publication date: 8-Nov-2016
https://dl.acm.org/doi/10.1145/2893472
Vigneron A(2014)Geometric optimization and sums of algebraic functionsACM Transactions on Algorithms10.1145/253264710:1(1-20)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1145/2532647
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents