Approximating sparsest cut in graphs of bounded treewidth

Authors:
Eden Chlamtac;Robert Krauthgamer;Prasad Raghavendra
Affiliations:
Weizmann Institute of Science, Rehovot, Israel;Weizmann Institute of Science, Rehovot, Israel;Microsoft Research New England, Cambridge, MA
Venue:
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Year:
2010

Citing 36
Cited 3

Asymptotic theory of finite dimensional normed spaces

Asymptotic theory of finite dimensional normed spaces
A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
Excluded minors, network decomposition, and multicommodity flow

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cut problems and their application to divide-and-conquer

Approximation algorithms for NP-hard problems
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm

SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
Approximation algorithms

Approximation algorithms
On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Semidefinite Programming vs. LP Relaxations for Polynomial Programming

Mathematics of Operations Research
On average distortion of embedding metrics into the line and into L1

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming

Mathematics of Operations Research
Cuts, Trees and ℓ1-Embeddings of Graphs*

Combinatorica
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Embedding k-Outerplanar Graphs into l1

SIAM Journal on Discrete Mathematics
Integrality gaps for sparsest cut and minimum linear arrangement problems

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT

Computational Complexity
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover

CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Linear programming relaxations of maxcut

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

ACM Transactions on Algorithms (TALG)
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Linear Level Lasserre Lower Bounds for Certain k-CSPs

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning

Journal of the ACM (JACM)
Integrality gaps for Sherali-Adams relaxations

Proceedings of the forty-first annual ACM symposium on Theory of computing
Sherali-adams relaxations of the matching polytope

Proceedings of the forty-first annual ACM symposium on Theory of computing
CSP gaps and reductions in the lasserre hierarchy

Proceedings of the forty-first annual ACM symposium on Theory of computing
MaxMin allocation via degree lower-bounded arborescences

Proceedings of the forty-first annual ACM symposium on Theory of computing
A Note on Multiflows and Treewidth

Algorithmica
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved Lower Bounds for Embeddings into $L_1$

SIAM Journal on Computing
A $(\log n)^{\Omega(1)}$ Integrality Gap for the Sparsest Cut SDP

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Flow-cut gaps for integer and fractional multiflows

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximate formulations for 0-1 knapsack sets

Operations Research Letters

The complexity of finding uniform sparsest cuts in various graph classes

Journal of Discrete Algorithms
Sparsest cut on bounded treewidth graphs: algorithms and hardness results

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Pathwidth, trees, and random embeddings

Combinatorica

Quantified Score

Hi-index	0.01

Visualization

Abstract

We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the flow-cut gap and/or metric embeddings, our approach exploits the Sherali-Adams hierarchy of linear programming relaxations.