• DOI:10.1007/978-3-642-15369-3_10
Corpus ID: 14464425

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}
}

• E. Chlamtác, Robert Krauthgamer, P. Raghavendra
• Published 2010
• Mathematics, Computer Science
• ArXiv

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed

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.