0( p log n) Approximation to (2004)

by Sanjeev Arora, Elad Hazan, Satyen Kale
Venue:SPARSEST CUT in O(n2) Time. In 45th Symp. on Foundations of Computer Science (FOCS