A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2

@article{Chuzhoy2012APA,
  title={A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2},
  author={Julia Chuzhoy and Shi Li},
  journal={ArXiv},
  year={2012},
  volume={abs/1208.1272}
}
In the Edge-Disjoint Paths with Congestion problem (\EDPwC), we are given an undirected $n$-vertex graph $G$, a collection $\mset=\set{(s_1, t_1), \ldots, (s_k, t_k)}$ of demand pairs and an integer $c$. The goal is to connect the maximum possible number of the demand pairs by paths, so that the maximum edge congestion - the number of paths sharing any edge - is bounded by $c$. When the maximum allowed congestion is $c=1$, this is the classical Edge-Disjoint Paths problem (\EDP). The best… 
Maximum edge-disjoint paths in planar graphs with congestion 2
TLDR
If every edge has capacity at least 2, then the integrality gap drops to a constant for planar graphs, and the concept of rooted clustering is introduced which the author believes is of independent interest.
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary
TLDR
This work uses a (completely different) linear program only to select the pairs to be routed, while the routing itself is computed by other methods, resulting in an efficient randomized $2^{O(\sqrt{\log n} \cdot \log\log n)}$-approximation algorithm for this problem.
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two
TLDR
This article gives a randomized O(n3/7 ċ poly(log n))-approximation algorithm with congestion two, and proves that there is a (randomized) polynomial-time algorithm for finding Ω(OPT1/p) edge-disjoint paths connecting given terminal pairs for some p > 1.
On Approximating Node-Disjoint Paths in Grids
TLDR
The algorithm shows that when all demand pairs are of the latter type, the integrality gap of the multicommodity flow LP-relaxation is at most O(n^{1/4} * log(n), and it is complemented by proving that NDP is APX-hard on grid graphs.
Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
TLDR
This work gives a polynomial time algorithm that routes Ω(OPT/poly log k) pairs with O(1) congestion, where OPT is the value of an optimum fractional solution to a natural multicommodity flow relaxation.
Routing in undirected graphs with constant congestion
TLDR
An efficient randomized algorithm is shown that routes Ω(OPT/poly log k) demand pairs with congestion at most 14, where OPT is the maximum number of pairs that can be simultaneously routed on edge-disjoint paths.
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
TLDR
The first deterministic, almost-linear time approximation algorithm for the classical Minimum Balanced Cut problem, which provides a stronger guarantee: it either returns a balanced cut whose value is close to a given target value, or it certifies that such a cut does not exist by exhibiting a large subgraph of $G$ that has high conductance.
New hardness results for routing on disjoint paths
TLDR
It is proved that NDP is 2Ω(√logn)-hard to approximate, unless all problems in NP have algorithms with running time nO(logn), and this result holds even when the underlying graph is a planar graph with maximum vertex degree 4, and all source vertices lie on the boundary of a single face.
Maximum Edge-Disjoint Paths in k-Sums of Graphs
TLDR
A polytime algorithm which takes a fractional routing solution in a graph of bounded treewidth and is able to integrally route a constant fraction of the LP solution's value and shows that such bounds hold for the class of k-sums of bounded genus graphs.
Improved approximation for node-disjoint paths in planar graphs
TLDR
A new linear programming relaxation of the classical Node-Disjoint Paths problem is introduced, and a number of new techniques are introduced that are hoped will be helpful in designing more powerful algorithms for this and related problems.
...
1
2
3
...

References

SHOWING 1-10 OF 32 REFERENCES
Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions
  • M. Andrews
  • Computer Science, Mathematics
    2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
TLDR
This work presents a $(polylog(n), poly(\log\log n))-approximation, which means that if there exists a solution that routes X demands integrally on edge-disjoint paths (i.e. with congestion $1), then the approximation algorithm can route X/polylog (n) demands with congestion.
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
TLDR
This paper studies the hardness of EDPwC in undirected graphs and shows an Ω(log logV/log log log V) hardness of approximation for EDPWC and an Φ(loglogV/ log log logV) hardness-of- approximation for the Undirected congestion minimization problem.
Optimal construction of edge-disjoint paths in random graphs
TLDR
The results give the first tight bounds for the edge-disjoint paths problem for any nontrivial class of graphs.
Routing in undirected graphs with constant congestion
TLDR
An efficient randomized algorithm is shown that routes Ω(OPT/poly log k) demand pairs with congestion at most 14, where OPT is the maximum number of pairs that can be simultaneously routed on edge-disjoint paths.
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
TLDR
This paper gives a randomized O(n3/7 • poly (log n))-approximation algorithm with congestion two, and shows that there is a randomized algorithm for finding Ω(OPT1/4) edge-disjoint paths connecting given terminal pairs with congestionTwo.
Edge Disjoint Paths in Moderately Connected Graphs
TLDR
This work shows a polylogarithmic approximation algorithm for the undirected EDP problem in general graphs with a moderate restriction on graph connectivity, and extends previous techniques in that it applies to graphs with high diameters and asymptotically large minors.
Hardness of the undirected edge-disjoint paths problem with congestion
  • M. Andrews, Lisa Zhang
  • Computer Science
    46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
TLDR
An improved hardness result for EDP is obtained, and the first polylogarithmic integrality gaps and hardness of approximation results for E DPwC are shown, and similar results can be obtained for the all-or-nothing flow (ANF) problem, a relaxation of EDP.
Edge-disjoint paths in expander graphs
  • A. Frieze
  • Mathematics, Computer Science
    SODA '00
  • 2000
TLDR
It is shown that if G has sufficiently strong expansion properties and r is sufficiently large, then all sets of $\kappa=\Omega(n/\log n)$ pairs of vertices can be joined.
Edge-disjoint paths in Planar graphs with constant congestion
TLDR
A constant factor approximation for the all-or-nothing flow problem on OS instances via the flow relaxation is developed and a lower bound of Ω(log n) is shown for general graphs and for planar graphs that suggest a super-constant lower bound.
Edge-disjoint paths in planar graphs
TLDR
The heart of the approach is to show that in any undirected planar graph, given any matching M on a well-linked set X, the authors can route /spl Omega/(|M|) pairs in M with a congestion of 2, and this result extends to the unsplittable flow problem and the maximum integer multicommodity flow problem.
...
1
2
3
4
...