Approximating Sparsest Cut in Graphs of Bounded Treewidth

Details Approximating Sparsest Cut in Graphs of Bounded Treewidth Approximating Sparsest Cut in Graphs of Bounded Treewidth

2010-06-21

arxiv.org/abs/1006.3970v2

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Approximating Sparsest Cut in Graphs of Bounded Treewidth does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximating Sparsest Cut in Graphs of Bounded Treewidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating Sparsest Cut in Graphs of Bounded Treewidth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-599546