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 (si, ti), 1 ≤i≤k, and the goal is to find a largest subset of source-sink pairs that can be simultaneously connected in an edge-disjoint manner. We show that in directed networks, for any e>0, EDP is NP-hard to approximate within m1/2-e. We also design simple approximation algorithms that achieve essentially matching approximation guarantees for some generalizations of EDP. Another related class of routing problems that we study concerns EDP with the additional constraint that the routing paths be of bounded length. We show that, for any e > 0, bounded length EDP is hard to approximate within m1/2-e even in undirected networks, and give an O(√m)-approximation algorithm for it. For directed networks, we show that even the single source-sink pair case (i.e. find the maximum number of paths of bounded length between a given source-sink pair) is hard to approximate within m1/2-e, for any e > 0.

[1]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[2]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[3]  William S. Massey,et al.  Algebraic Topology: An Introduction , 1977 .

[4]  Alexander Schrijver,et al.  Paths, Flows, and VLSI-Layout , 1990 .

[5]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[6]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[7]  Éva Tardos,et al.  Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks , 1998, J. Comput. Syst. Sci..

[8]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[9]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[10]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[11]  Clifford Stein,et al.  Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .

[12]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[13]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[14]  Aravind Srinivasan,et al.  Approximating low-congestion routing and column-restricted packing problems , 2000, Inf. Process. Lett..

[15]  Jon M. Kleinberg,et al.  Decision algorithms for unsplittable flow and the half-disjoint paths problem , 1998, STOC '98.

[16]  Stavros G. Kolliopoulos,et al.  Exact and approximation algorithms for network flow and disjoint-path problems , 1998 .

[17]  Jon M. Kleinberg,et al.  Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[18]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Michel X. Goemans,et al.  On the Single-Source Unsplittable Flow Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[21]  Aravind Srinivasan,et al.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[22]  Andreas Bley,et al.  On the complexity of vertex-disjoint length-restricted path problems , 2004, computational complexity.

[23]  Mihalis Yannakakis,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[24]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[25]  Yuval Rabani,et al.  Improved bounds for all optical routing , 1995, SODA '95.

[26]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[27]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[28]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[29]  Bin Ma,et al.  On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints , 2000, J. Comput. Syst. Sci..

[30]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .