Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut

@inproceedings{Makarychev2014BiluLinialSI,
  title={Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut},
  author={Konstantin Makarychev and Yury Makarychev and Aravindan Vijayaraghavan},
  booktitle={SODA},
  year={2014}
}
We investigate the notion of stability proposed by Bilu and Linial. We obtain an exact polynomial-time algorithm for γ-stable Max Cut instances with γ ≥ c√log n log log n for some absolute constant c > 0. Our algorithm is robust: it never returns an incorrect answer; if the instance is γ-stable, it finds the maximum cut, otherwise, it either finds the maximum cut or certifies that the instance is not γ-stable. We prove that there is no robust polynomial-time algorithm for γ-stable instances of… Expand
Bilu-Linial stability, certified algorithms and the Independent Set problem
TLDR
A general result is proved showing that the integrality gap of convex relaxations of several maximization problems reduces dramatically on stable instances of Node Multiway Cut. Expand
Solving (k-1)-Stable Instances of k-terminal cut with Isolating Cuts
TLDR
This paper concludes that the $(2-2/k)-approximation algorithm returns the optimal solution on $(k-1)$-stable instances of the k-Terminal Cut problem, and is the first result showing that this $(1-1-\epsilon)- approximation is an exact optimization algorithm on a special class of graphs. Expand
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
TLDR
It is shown that for any fixed \epsilon>0, (1+\ep silon)-stable instances of k-Means in doubling metrics can be solved in polynomial time and under a plausible PCP hypothesis this is essentially tight. Expand
The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n
We prove that the integrality gap of the Goemans-Linial semidefinite programming relaxation for the Sparsest Cut Problem is Ω(√logn) on inputs with n vertices, thus matching the previously best knownExpand
Algorithms for stable and perturbation-resilient problems
TLDR
An exact algorithm is given for 2-perturbation resilient instances of clustering problems with natural center-based objectives and an exact algorithm for (2-2/k)-stable instances of Minimum Multiway Cut with k terminals is given. Expand
Clustering Perturbation Resilient Instances
TLDR
This work considers stable instances of Euclidean $k-means that have provable polynomial time algorithms for recovering optimal cluster and proposes simple algorithms with running time linear in the number of points and the dimension that provably recover the optimal clustering. Expand
Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics
TLDR
This work shows that the aforementioned sparsest cut heuristic in fact obtains an O(alpha_n)-approximation for hierarchical clustering, and presents a spreading metric SDP relaxation for the problem and shows that it has integrality gap at most O(sqrt{log n}). Expand
Certified Algorithms: Worst-Case Analysis and Beyond
TLDR
The notion of a certified algorithm is introduced, its properties are described, a framework for designing certified algorithms is presented, and examples of certified algorithms for Max Cut/Min Uncut, Minimum Multiway Cut, k-medians and k-means are provided. Expand
A Polynomial-Time Algorithm for (2-2/k)-stable Instances of the k-terminal cut Problem
TLDR
This paper shows that $\gamma$-stable instances of $k$-terminal cut can be solved in polynomial time for $gamma \geq 2 - 2/k$ with a faster algorithm, and shows that a known $(2-2/k)$-approximation algorithm for the problem actually delivers the unique optimal solution for $(2 - 2 /k)-stable graphs. Expand
Symmetric and Asymmetric $k$-center Clustering under Stability
TLDR
This work proves the first problem that is hard to approximate to any constant factor in the worst case, yet can be optimally solved in polynomial time under perturbation resilience for a constant value of $\alpha$ and provides strong positive results both for the asymmetric and symmetric k-center problems under a very natural input stability (promise) condition. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
TLDR
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. Expand
Hardness of cut problems in directed graphs
TLDR
Direct multicut is Ω(log n / log log n)-hard to approximate unless NP ⊆ DTIME (npolylog n) and it is shown that this hardness result holds even when a bicriteria relaxation is allowed, where the approximate solution is required to separate only a constant fraction of the pairs. Expand
Simplex partitioning via exponential clocks and the multiway cut problem
TLDR
This work presents a novel simplex partitioning algorithm which is based on em competing exponential clocks and distortion and obtains a simple (4/3)-approximation algorithm, thus, improving upon the current best known result. Expand
.879-approximation algorithms for MAX CUT and MAX 2SAT
TLDR
This research presents randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected value at least .87856 times the optimal value and represents the first use of semidefinite programming in the design of approximation algorithms. Expand
Data Stability in Clustering: A Closer Look
  • L. Reyzin
  • Mathematics, Computer Science
  • ALT
  • 2012
TLDR
It is shown that multiplicative resilience parameters, even only on the order of Θ(1), can be so strong as to make the clustering problem trivial, and is exploited to present a simple one-pass streaming algorithm for the k-median objective. Expand
Approximation algorithms for semi-random partitioning problems
TLDR
A new semi-random model for graph partitioning problems that captures many properties of real-world instances and works in a wider range of parameters than most algorithms for previously studied random and semi- random models is proposed. Expand
Center-based clustering under perturbation stability
TLDR
This paper proves that the conjecture that instances stable to as little as O(1) perturbations should be solvable in polynomial time is true for any center-based clustering objective, and shows that the popular Single-Linkage algorithm combined with dynamic programming will find the optimal clustering. Expand
The Complexity of Multiterminal Cuts
TLDR
It is shown that the problem becomes NP-hard as soon as $k=3$, but can be solved in polynomial time for planar graphs for any fixed $k$, if the planar problem is NP- hard, however, if £k$ is not fixed. Expand
An improved approximation algorithm for multiway cut
TLDR
A new linear programming relaxation for Multiway Cut is presented and a new approximation algorithm based on it achieves a performance ratio of at most 1.5?1k, which improves the previous result for every value of k. Expand
On unique graph 3-colorability and parsimonious reductions in the plane
TLDR
It is proved that the Satisfiability (resp. planar Satisfiability) problem is parsimoniously P-time reducible to the 3-Colorability problem, that means that the exact number of solutions is preserved by the reduction, provided that 3-colorings are counted modulo their six trivial color permutations. Expand
...
1
2
3
4
5
...