Approximation Algorithms and Hardness of the k-Route Cut Problem

@article{Chuzhoy2011ApproximationAA,
title={Approximation Algorithms and Hardness of the k-Route Cut Problem},
author={Julia Chuzhoy and Yury Makarychev and Aravindan Vijayaraghavan and Yuan Zhou},
journal={ArXiv},
year={2011},
volume={abs/1112.3611}
}
• Published 15 December 2011
• Computer Science
• ArXiv
We study the <i>k</i>-route cut problem: given an undirected edge-weighted graph <i>G</i> = (<i>V</i>, <i>E</i>), a collection {(<i>s</i><sub>1</sub>, <i>t</i><sub>1</sub>), (<i>s</i><sub>2</sub>, <i>t</i><sub>2</sub>), …, (<i>s<sub>r</sub></i>, <i>t<sub>r</sub></i>)} of source-sink pairs, and an integer connectivity requirement <i>k</i>, the goal is to find a minimum-weight subset <i>E</i>′ of edges to remove, such that the connectivity of every pair (<i>s<sub>i</sub></i>, <i>t<sub>i</sub></i…

Figures and Tables from this paper

• Computer Science
SODA
• 2015
The main technical innovation is the definition of a new, powerful \emph{region growing} lemma that allows us to perform region-growing in a recursive fashion even though the LP solution yields a {\em different metric} for each source-sink pair.
• Computer Science
SIAM J. Comput.
• 2014
Efficient algorithms for constructing a flow-sparsifier H that maintains congestion up to a factor ofO(log k/log log k) where k = |K| and a convex combination of trees over the terminals K that maintains congested graphs is given.
• Computer Science
WALCOM
• 2014
A polynomial-time heuristic algorithm for both cases of a max-flow problem against k edge failures, called the iterative multiroute flow, which shows that the average improvement made by the heuristic method can be up to 10% better than the multirout flow algorithm.
• Computer Science, Mathematics
Theory Comput.
• 2016
The Hypergraph Small Set Expansion problem, which asks to compute the cut having the least expansion while having at most $\delta$ fraction of the vertices on the smaller side of the cut, is studied and two algorithms are presented that give an $\tilde O(\delta^{-1} \sqrt{\log n})$ approximation and an algorithm that finds a set with vertex expansion.
• Mathematics
• 2018
. The densest k -subgraph (D k S) problem and its corresponding minimization problem smallest p -edge subgraph (S p ES) have come to play a central role in approximation algorithms. This is due both
It is shown, assuming the exponential time hypothesis (ETH), that there is no polynomial-time algorithm that approximates Densest k-Subgraph to within n1/(loglogn)c factor of the optimum, where c > 0 is a universal constant independent of n.
• Computer Science
Networks
• 2017
The first such approximation algorithm, which has approximation ratio at most 2(n−1) for any graph with n vertices, is presented, and it is shown that any nϵ‐approximation algorithm for Network Flow Interdiction, or one of several variants, would imply a 2n4ϵ-approximating algorithm for Densest k‐Subgraph, which is an improvement over past work in terms of the polynomial factor.
• Mathematics, Computer Science
ArXiv
• 2017
A new algorithm is given that approximates Dense-$3$-Subhypergraph within a ratio of $\tilde O(n/k)$, which improves the ratio of $O(n^2/k^2)$ of Chlamt{\'{a}}c et al.
• Mathematics, Geology
ArXiv
• 2019
We study the problem of interdicting a directed graph by deleting nodes with the goal of minimizing the local edge connectivity of the remaining graph from a given source to a sink. We show hardness

References

SHOWING 1-10 OF 46 REFERENCES

• Economics
SODA '07
• 2007
The max-flow min-cut theorem for the single source multicommodity multiroute flow and cut is established and a 2-approximation algorithm for the minimum h-disconnecting cut problem is described.
• Mathematics, Computer Science
SPAA '03
• 2003
An approximation algorithm is proposed that improves previously known bounds for many classes of graphs by connecting any two edge-intersecting vertices in a graph by edge disjoint paths of average length O(k F).
• Computer Science, Mathematics
SODA '10
• 2010
An extension of the region growing technique for approximating minimum multicuts to the multi-route setting and presents a number of different algorithms achieving different cost-connectivity tradeoffs.
• Computer Science
ICALP
• 2008
This paper considers the case of K= 2 and obtains poly-logarithmic approximation algorithms for fundamental cut problems including single-source, multiway-cut, multicut, and sparsest cut, and shows that the flow-cut gap between 2- route cuts and 2-route flows is poly- Logarithsmic in undirected graphs with arbitrary capacities.
• Computer Science
ESA
• 2005
The MinSBCC problem is introduced, and it is shown that the problem with unit weight nodes can be solved optimally in polynomial time, and when the nodes have weights, approximated arbitrarily well by a PTAS.
• Computer Science, Mathematics
SIAM J. Discret. Math.
• 2007
The aim is to find a subset of requests of maximum total demand for which it is possible to select flow paths such that all the capacity constraints are maintained and each selected request with demand d_i is connected by disjoint paths, each of flow value $d_i/k$.
• Computer Science
SIAM J. Comput.
• 2014
Efficient algorithms for constructing a flow-sparsifier H that maintains congestion up to a factor ofO(log k/log log k) where k = |K| and a convex combination of trees over the terminals K that maintains congested graphs is given.
• Computer Science, Mathematics
APPROX
• 2002
The first lower bound on the approximability of SNDP is given, showing that the problem admits no efficient 2log1-?n ratio approximation for any fixed ?
• Computer Science, Mathematics
STOC
• 2008
This work gets a poly-logarithmic approximation for any constant k in the survivable network design problem (SNDP), and shows that SNDP is kΩ(1)-hard to approximate and provides an elementary construction that shows that the well-studied set-pair linear programming relaxation for this problem has an Ω(k1/3) integrality gap.
• Computer Science
JACM
• 1999
This paper establishes max-flow min-cut theorems for several important classes of multicommodity flow problems and uses the result to design the first polynomial-time (polylog n-times-optimal) approximation algorithms for well-known NP-hard optimization problems.