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

### Cached

### Download Links

Venue: | IN PROCEEDINGS 45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS'04 |

### BibTeX

@INPROCEEDINGS{Arora04o(√logn),

author = {Sanjeev Arora and Elad Hazan and Satyen Kale},

title = {O(√log n) approximation to sparsest cut in Õ(n²) time},

booktitle = {IN PROCEEDINGS 45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS'04},

year = {2004},

pages = {238--247},

publisher = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

We show how to compute O (√log n)-approximations to Sparsest Cut and Balanced Separator problems in Õ(n²) time, thus improving upon the recent algorithm of Arora, Rao and Vazirani (2004). Their algorithm uses semidefinite programming and required Õ(n4.5) time. Our algorithm relies on efficiently finding expander flows in the graph and does not solve semidefinite programs. The existence of expander flows was also established by Arora, Rao, and Vazirani.