Euclidean distortion and the sparsest cut
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
On partitioning graphs via single commodity flows
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Geometry, flows, and graph-partitioning algorithms
Communications of the ACM
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Finding sparse cuts locally using evolving sets
Proceedings of the forty-first annual ACM symposium on Theory of computing
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
An SDP primal-dual algorithm for approximating the Lovász-theta function
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Connectivity oracles for failure prone graphs
Proceedings of the forty-second ACM symposium on Theory of computing
Bilipschitz snowflakes and metrics of negative type
Proceedings of the forty-second ACM symposium on Theory of computing
Near-optimal distortion bounds for embedding doubling spaces into L1
Proceedings of the forty-third annual ACM symposium on Theory of computing
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
The laplacian paradigm: emerging algorithms for massive graphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
SIAM Journal on Computing
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
| Hi-index | 0.02 |
We show how to compute 0(\sqrt {\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 脮(n^{4.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.