O(√log n) approximation to sparsest cut in Õ(n²) time (2004)

by Sanjeev Arora , Elad Hazan , Satyen Kale
Venue:IN PROCEEDINGS 45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS'04