activity
20092016
most citedNearly Maximum Flows in Nearly Linear Time

6 citations · 10 across the 4 of their papers we have counts for

collaborators
Showing 2009Show all

1 paper · 1 filter

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…