6 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DS2013★ 6 cited
Nearly Maximum Flows in Nearly Linear Time
Jonah Sherman
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using -\emph{congestion-approximators}: easy-to-compute functions that approximate the…
cs.DS2009★ 1 cited
Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut
Jonah Sherman
This paper ties the line of work on algorithms that find an O(sqrt(log(n)))-approximation to the sparsest cut together with the line of work on algorithms that run in sub-quadratic…