1 citations · 1 across the 1 of their papers we have counts for
1 paper
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…