Approximating Sparsest Cut in Graphs of Bounded Treewidth

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.

• Type: Conference
• Year: 2010
• Where: APPROX
• Authors: Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra
• Keywords: Algorithms, APPROX 2010, Constant-factor Approximation Algorithm, Linear Programming Relaxations, Metric Embeddings