Approximating Sparsest Cut in Graphs of Bounded Treewidth

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-599546

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.