13 citations · 24 across the 8 of their papers we have counts for
1 paper · 1 filter
Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra
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 f…