Approximating Sparsest Cut in Graphs of Bounded Treewidth

Eden Chlamtac,Robert Krauthgamer,Prasad Raghavendra

APPROX/RANDOM'10: Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques（2010）

引用 16|浏览29

暂无评分

摘要

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.

查看译文

关键词

Sherali-Adams hierarchy,bounded treewidth graph,constant-factor approximation algorithm,flow-cut gap,general demand,linear programming relaxation,metric embeddings,previous algorithm,sparsest cut

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要