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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Expander flows, geometric embeddings and graph partitioning. https://app.cochat.ai/papers/10.1145/1007352.1007355
- The paper
- Arora, S., Rao, S., & Vazirani, U. (2004). Expander flows, geometric embeddings and graph partitioning. Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. https://doi.org/10.1145/1007352.1007355
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.