2000 character limit reached
Approximating Sparsest Cut in Graphs of Bounded Treewidth (1006.3970v2)
Published 21 Jun 2010 in cs.DS
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
