Approximating Sparsest Cut in Graphs of Bounded Treewidth

@article{Chlamtc2010ApproximatingSC,
  title={Approximating Sparsest Cut in Graphs of Bounded Treewidth},
  author={E. Chlamt{\'a}c and Robert Krauthgamer and P. Raghavendra},
  journal={ArXiv},
  year={2010},
  volume={abs/1006.3970}
}
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. 
17 Citations
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
  • 30
  • Highly Influenced
  • PDF
Pathwidth, trees, and random embeddings
  • 9
  • PDF
Integrality Gaps for Bounded Color Matchings
Integrality gaps for colorful matchings
  • PDF
The complexity of finding uniform sparsest cuts in various graph classes
  • 2
Everywhere-Sparse Spanners via Dense Subgraphs
  • 39
  • PDF
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs
  • 5
  • PDF
Cheeger-Type Approximation for Sparsest st-Cut
  • 2
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 58 REFERENCES
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
  • 151
  • PDF
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
  • 31
  • PDF
Expander flows, geometric embeddings and graph partitioning
  • 497
  • Highly Influential
  • PDF
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor
  • 58
Embedding k-outerplanar graphs into ℓ1
  • 57
  • PDF
Euclidean distortion and the sparsest cut
  • 199
  • Highly Influential
  • PDF
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
  • 276
  • PDF
Proving Integrality Gaps without Knowing the Linear Program
  • 86
  • PDF
Approximate formulations for 0-1 knapsack sets
  • D. Bienstock
  • Mathematics, Computer Science
  • Oper. Res. Lett.
  • 2008
  • 44
  • PDF
...
1
2
3
4
5
...