14 citations · 56 across the 7 of their papers we have counts for
1 paper · 1 filter
Anupam Gupta, Kunal Talwar, David Witmer
We give a 2-approximation algorithm for Non-Uniform Sparsest Cut that runs in time nO(k), where k is the treewidth of the graph. This improves on the previous 22k-appr…