The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Expander flows, geometric embeddings and graph partitioning
Abstract
We give a O(√log n)-approximation algorithm for sparsest cut, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leighton and Rao (1988). We use a well-known semidefinite relaxation with triangle inequality constraints. Central to our analysis is a geometric theorem about projections of point sets in Rd, whose proof makes essential use of a phenomenon called measure concentration. We also describe an interesting and natural "certificate" for a graph's expansion, by embedding an n-node expander in it with appropriate dilation and congestion. We call this an expander flow.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
(2011) · SpringerReference · doi:10.1007/springerreference_57547 · Cited by 3,190
On the Shannon capacity of a graph
Lovasz, L. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055985 · Cited by 1,624
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Lubotzky, A., Phillips, R., & Sarnak, P. (1988) · Combinatorica · doi:10.1007/bf02126799 · Cited by 1,011
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
A Lower Bound for the Smallest Eigenvalue of the Laplacian
Cheeger, J. (2015) · Problems in Analysis: A Symposium in Honor of Salomon Bochner (PMS-31) · doi:10.1515/9781400869312-013 · Cited by 961
The geometry of graphs and some of its algorithmic applications
Linial, N., London, E., & Rabinovich, Y. (1995) · Combinatorica · doi:10.1007/bf01200757 · Cited by 952
Sherali, H. D., & Adams, W. P. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403036 · Cited by 931
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Alizadeh, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805002 · Cited by 892
λ1, Isoperimetric inequalities for graphs, and superconcentrators
Alon, N., & Milman, V. D. (1985) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(85)90092-9 · Cited by 839
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Leighton, T., & Rao, S. (1999) · Journal of the ACM · doi:10.1145/331524.331526 · Cited by 820
Self-citationJerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
Vazirani, V. V. (2003) · Springer eBooks · doi:10.1007/978-3-662-04565-7 · Cited by 716
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
Garg, N., & Könemann, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743463 · Cited by 561
On lipschitz embedding of finite metric spaces in Hilbert space
Bourgain, J. (1985) · Israel Journal of Mathematics · doi:10.1007/bf02776078 · Cited by 560
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Plotkin, S. A., Shmoys, D. B., & Tardos, É. (1995) · Mathematics of Operations Research · doi:10.1287/moor.20.2.257 · Cited by 542
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Sinclair, A. (1992) · Combinatorics, Probability and Computing · doi:10.1017/s0963548300000390 · Cited by 498
An Elementary Introduction to Modern Convex Geometry
Ball, K. (1997) · Cambridge University Press eBooks · doi:10.1017/9781009701853.002 · Cited by 483
Comparison Theorems for Reversible Markov Chains
Diaconis, P., & Saloff-Coste, L. (1993) · The Annals of Applied Probability · doi:10.1214/aoap/1177005359 · Cited by 423
Approximate graph coloring by semidefinite programming
Karger, D., Motwani, R., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/274787.274791 · Cited by 420
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
Garg, N., Vazirani, V. V., & Yannakakis, M. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793243016 · Cited by 335
Khot, S. A., & Vishnoi, N. K. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.74 · Cited by 263
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
Aumann, Y., & Rabani, Y. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794285983 · Cited by 260
Semidefinite programming in combinatorial optimization
Goemans, M. X. (1997) · Mathematical Programming · doi:10.1007/bf02614315 · Cited by 208
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Agarwal, A., Charikar, M., Makarychev, K., & Makarychev, Y. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060675 · Cited by 178
A 7/8-approximation algorithm for MAX 3SAT?
Karloff, H., & Zwick, U. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646129 · Cited by 168
Lifting Markov chains to speed up mixing
Chen, F., Lovász, L., & Pak, I. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301315 · Cited by 158
A Better Approximation Ratio for the Vertex Cover Problem
Karakostas, G. (2005) · Lecture notes in computer science · doi:10.1007/11523468_84 · Cited by 112
Improved Approximation Algorithms for MAX SAT
Asano, T., & Williamson, D. P. (2002) · Journal of Algorithms · doi:10.1006/jagm.2001.1202 · Cited by 100
0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n²) Time
Arora, S., Hazan, E., & Kale, S. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.1 · Cited by 51
Self-citation
Cited by
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Consistency of spectral clustering
von Luxburg, U., Belkin, M., & Bousquet, O. (2008) · The Annals of Statistics · doi:10.1214/009053607000000640 · Cited by 540
Can ISPS and P2P users cooperate for improved performance?
Aggarwal, V., Feldmann, A., & Scheideler, C. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1273445.1273449 · Cited by 393
Metadata
- Authors
- Arora, S., Rao, S., & Vazirani, U.
- Venue
- Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2004-06-13
- Pages
- 222-231
- OpenAlex
- W2020632401
- Cited by
- 297
- References
- 34
- FWCI
- 21.68
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.