1. O(√log n) APPROXIMATION TO SPARSEST CUT IN ō(n2) TIME.
- Author
-
Arora, Sanjeev, Hazan, Elad, and Kale, Satyen
- Subjects
- *
APPROXIMATION theory , *POLYNOMIALS , *ALGORITHMS , *MATHEMATICAL analysis , *NUMERICAL analysis - Abstract
This paper shows how to compute O(√log n)-approximations to the Sparsest Cut and Balanced Separator problems in Õ(n²) time, thus improving upon the recent algorithm of Arora, Rao, and Vazirani [Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004, pp. 222-231]. Their algorithm uses semidefinite programming and requires Õ (n9.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. [ABSTRACT FROM AUTHOR]
- Published
- 2009