Article

Free access

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Authors:

Venkatesan Guruswami,

Sanjeev Khanna,

Rajmohan Rajaraman,

Bruce Shepherd,

Mihalis YannakakisAuthors Info & Claims

STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of Computing

Pages 19 - 28

https://doi.org/10.1145/301250.301262

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

A. BAVEJA AND A. $RINIVASAN. Approximation algorithms for disjoint paths and related routing and packing problems. Submitted, January 1998.

Digital Library

Google Scholar

[2]

A. BLEY. On the complexity of vertex-disjoint lengthrestricted path problems. Konrad. Zuse-Zentrum fiir In- ~ormationstechnik Berlin Tech. Report $C-98-~0, 1998.

Google Scholar

[3]

~I. CHERNOFF. A measure of asymptotic e~ciency for tests of a hypothesis based on the sum of observations. Annals o)~ Mathematical Statistics, 23:493-507, 1952.

Google Scholar

[4]

E. A. DINITZ. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl., Vol. 11 (1970), pp. 1277-1280.

Google Scholar

[5]

Y. D~N~Tz, N. G^RG AND M. GOrM~NS. On ~he single source unsplittable flow problem, Proc. ojr FOC$ '98, pp. 290-299.

Digital Library

Google Scholar

[6]

S. EVEN, A. ITA~ AND A. SHAMIR. On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, Vol. 5, No. 4 (I976), pp. 691- 703.

Crossref

Google Scholar

[7]

S. FORTUSE, J. HorcRorT ~D J. WYLbm. The directed subgraph homeomorphism problem. Theoretical Computer Science, Vol. 10, No. 2 (1980), pp. 111-121.

Crossref

Google Scholar

[8]

N. (~ARG, V. VAZIRANI AND M. YANNAKAKIS. Primaldual approximation algorithms for integral flow and multicut in trees. Algorighmica, 18 (1997), pp. 3-20.

Digital Library

Google Scholar

[9]

W. HOEFFDING. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.

Crossref

Google Scholar

[10]

J. H~STAD. Clique is hard to approximate within ~-'. ECCC Technical Report TR97-038. (PreIiminary version in Proc. of FOCS '96, pp. 527-536).

Google Scholar

[11]

T. C. Hu. Multi-commodity Network Flows. Operations Research, 11(1963), pp. 344-360.

Google Scholar

[12]

V. KANN. Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters, 37(1991), pp. 27-35.

Digital Library

Google Scholar

[13]

R. M. K~.r.l~. Reducibility among combinatdriat problems. Complexity of Computer Computations, R.E. Miller, J.W. Thatcher, Eds., New York: Plenum Press, 1972, pp. 85-103.

Google Scholar

[14]

J. M. KLE~r/BERG. Single-source unsplittable flow. Proc. of FOCS '96, pp. 68-77.

Digital Library

Google Scholar

[15]

J. M. KLEINBERG. Appro~mation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA, May 1996.

Digital Library

Google Scholar

[16]

J. M. KLEINBEgG. Decision algorithms for unsplittable flow and the half-disjoint paths problem. Proc. of STOC '98, pp. 530-539.

Digital Library

Google Scholar

[17]

S. G. Ko~r~orouLos. Exact and approximation algorithms for network flow and disjoint-path problems. PhD Thesis, Dartmouth ColIege, Hanover, NH, August 1998.

Google Scholar

[18]

S. G. Kor~.~orovLos ^rq~) C. STEI~. Improved approximation algorithms for unsplittable flow problems. Proc. o.f FOCS '9'7, pp. 426-435.

Digital Library

Google Scholar

[19]

S. G. KOLL~OrOVLOS ^ND C. STrIN. Approximating disjoint-path problems using greedy algorithms and Packing Integer Programs. IPCO 98.

Google Scholar

[20]

F. T. LS~C.I~TOl~ ^~) S. B. R~.o. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. Proc. oj~ FOCS '88, pp. 422-431.

Digital Library

Google Scholar

[21]

B. M^ ~ND L. W^NG. On the inapproximability of disjoint paths and minimum steiner forest with bandwidth constraints. Journal of Computer and Systems Sciences, to appear.

Digital Library

Google Scholar

[22]

W. S. M~.ssrY. Algebraic Topology: An Introduction. Graduate texts in mathematics 56, Springer-Verlag, 1967.

Google Scholar

[23]

P. R^an~w~ ~ C. D. TnoM?sor~. Randomized rounding: A technique for provably good algorithms and ~gorithmic proofs. Combinatorica, Vol. 7 (1987), pp. 365-374.

Digital Library

Google Scholar

[24]

N. ROBERT$ON AND P. D. SEYMOUR. Outline of a disjoint paths algorithm. In B. Korte, L. Lovksz, H. J. PrSmel, and A. Schrijver, Eds., Paths, Flows and VLSI-Layout. Springer-Verlag, Berlin, 1990.

Google Scholar

[25]

A. Sg~N~VASAN. Improved approximations for edgedisjoint paths, unsplittable flow, and related routing problems. Proc. of FOCS'97, pp. 416-425.

Digital Library

Google Scholar

Cited By

View all

Saad R(2024)Parallel Connectivity in Edge-Colored Complete Graphs: Complexity ResultsGraphs and Combinatorics10.1007/s00373-023-02747-440:2Online publication date: 10-Feb-2024
https://doi.org/10.1007/s00373-023-02747-4
Martín BSánchez ÁBeltran‐Royo CDuarte A(2018)Solving the edge‐disjoint paths problem using a two‐stage methodInternational Transactions in Operational Research10.1111/itor.1254427:1(435-457)Online publication date: 30-Apr-2018
https://doi.org/10.1111/itor.12544
Liang QModiano E(2017)Survivability in Time-Varying NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2016.263615216:9(2668-2681)Online publication date: 1-Sep-2017
https://doi.org/10.1109/TMC.2016.2636152
Show More Cited By

Index Terms

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Network flows
  2. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems
    2. Graph algorithms analysis
      1. Network flows

Recommendations

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 ...
On complexities of finding disjoint paths and related problems
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two

In the maximum edge-disjoint paths problem, we are given a graph and a collection of pairs of vertices, and the objective is to find the maximum number of pairs that can be routed by edge-disjoint paths. An r-approximation algorithm for this problem is ...

Comments

Information & Contributors

Information

Published In

STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of Computing

May 1999

790 pages

ISBN:1581130678

DOI:10.1145/301250

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 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC99

Sponsor:

SIGACT

STOC99: ACM Symposium on Theory of Computing

May 1 - 4, 1999

Georgia, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

90
Total Citations
View Citations
767
Total Downloads

Downloads (Last 12 months)98
Downloads (Last 6 weeks)16

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Saad R(2024)Parallel Connectivity in Edge-Colored Complete Graphs: Complexity ResultsGraphs and Combinatorics10.1007/s00373-023-02747-440:2Online publication date: 10-Feb-2024
https://doi.org/10.1007/s00373-023-02747-4
Martín BSánchez ÁBeltran‐Royo CDuarte A(2018)Solving the edge‐disjoint paths problem using a two‐stage methodInternational Transactions in Operational Research10.1111/itor.1254427:1(435-457)Online publication date: 30-Apr-2018
https://doi.org/10.1111/itor.12544
Liang QModiano E(2017)Survivability in Time-Varying NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2016.263615216:9(2668-2681)Online publication date: 1-Sep-2017
https://doi.org/10.1109/TMC.2016.2636152
Ashraf U(2017)Rule Minimization for Traffic Evolution in Software-Defined NetworksIEEE Communications Letters10.1109/LCOMM.2016.263621221:4(793-796)Online publication date: Apr-2017
https://doi.org/10.1109/LCOMM.2016.2636212
Jia YXu WLiu X(2017)An Optimization Framework for Online Ride-Sharing Markets2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2017.185(826-835)Online publication date: Jun-2017
https://doi.org/10.1109/ICDCS.2017.185
Medagliani PLeguay JAbdullah MLeconte MParis S(2016)Global Optimization for Hash-Based Splitting2016 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2016.7841861(1-6)Online publication date: Dec-2016
https://doi.org/10.1109/GLOCOM.2016.7841861
Pei GParthasarathy SSrinivasan AVullikanti A(2013)Approximation algorithms for throughput maximization in wireless networks with delay constraintsIEEE/ACM Transactions on Networking10.1109/TNET.2013.224741521:6(1988-2000)Online publication date: 1-Dec-2013
https://dl.acm.org/doi/10.1109/TNET.2013.2247415
Kawarabayashi K(2011)The disjoint paths problemProceedings of the 5th international conference on WALCOM: algorithms and computation10.5555/1966169.1966172(2-7)Online publication date: 18-Feb-2011
https://dl.acm.org/doi/10.5555/1966169.1966172
Kawarabayashi KKobayashi YFortnow LVadhan S(2011)Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion twoProceedings of the forty-third annual ACM symposium on Theory of computing10.1145/1993636.1993648(81-88)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993636.1993648
Pei GAnil Kumar VParthasarathy SSrinivasan A(2011)Approximation algorithms for throughput maximization in wireless networks with delay constraints2011 Proceedings IEEE INFOCOM10.1109/INFCOM.2011.5934887(1116-1124)Online publication date: Apr-2011
https://doi.org/10.1109/INFCOM.2011.5934887
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations