The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1
Open accessAbstract
In this paper, we disprove the following conjecture due to Goemans (1997) and Linial (2002): "Every negative type metric embeds into with constant distortion." We show that for every /spl delta/ > 0, and for large enough n, there is an n-point negative type metric which requires distortion at-least (log log n) /sup 1/6-/spl delta// to embed into l/sub 1/. Surprisingly, our construction is inspired by the Unique Games Conjecture (UGC) of Khot (2002), establishing a previously unsuspected connection between PCPs and the theory of metric embeddings. We first prove that the UGC implies super-constant hardness results for (non-uniform) sparsest cut and minimum uncut problems. It is already known that the UGC also implies an optimal hardness result for maximum cut (2004). Though these hardness results depend on the UGC, the integrality gap instances rely "only" on the PCP reductions for the respective problems. Towards this, we first construct an integrality gap instance for a natural SDP relaxation of unique games. Then, we "simulate" the PCP reduction and "translate"the integrality gap instance of unique games to integrality gap instances for the respective cut problems! This enables us to prove a (log log n) /sup 1/6-/spl delta// integrality gap for (nonuniform) sparsest cut and minimum uncut, and an optimal integrality gap for maximum cut. All our SDP solutions satisfy the so-called "triangle inequality" constraints. This also shows, for the first time, that the triangle inequality constraints do not add any power to the Goemans-Williamson's SDP relaxation of maximum cut. The integrality gap for sparsest cut immediately implies a lower bound for embedding negative type metrics into l/sub i/. It also disproves the non-uniform version of Arora, Rao and Vazirani's Conjecture (2004), asserting that the integrality gap of the sparsest cut SDP, with the triangle inequality constraints, is bounded from above by a constant.
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
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Deza, M. M., & Laurent, M. (1997) · Algorithms and combinatorics · doi:10.1007/978-3-642-04295-9 · Cited by 1,014
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
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
On the power of unique 2-prover 1-round games
Khot, S. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.510017 · Cited by 818
Self-citationVertex cover might be hard to approximate to within 2−ε
Khot, S., & Regev, O. (2007) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.06.019 · Cited by 795
Self-citationOn lipschitz embedding of finite metric spaces in Hilbert space
Bourgain, J. (1985) · Israel Journal of Mathematics · doi:10.1007/bf02776078 · Cited by 560
Expander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007355 · Cited by 297
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
Two-prover one-round proof systems: Their power and their problems
Feige, U., & Lovász, L. (1992) · Symposium on the Theory of Computing · Cited by 181
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
Two-prover one-round proof systems: their power and their problems (extended abstract)
Feige, U., & Lovász, L. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129783 · Cited by 161
A better approximation ratio for the vertex cover problem
Karakostas, G. (2009) · ACM Transactions on Algorithms · doi:10.1145/1597036.1597045 · Cited by 156
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
Khot, S., Kindler, G., Mossel, E., & O’Donnell, R. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.49 · Cited by 145
Self-citationOn the power of unique 2-prover 1-round games
Khot, S. (2003) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2002.1004334 · Cited by 135
Self-citationOn the optimality of the random hyperplane rounding technique for MAX CUT
Feige, U., & Schechtman, G. (2002) · Random Structures and Algorithms · doi:10.1002/rsa.10036 · Cited by 127
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
Cited by
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
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Expander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2009) · Journal of the ACM · doi:10.1145/1502793.1502794 · Cited by 418
Optimal algorithms and inapproximability results for every CSP?
Raghavendra, P. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374414 · Cited by 384
Expander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007355 · Cited by 297
Metadata
- Authors
- Khot, S. A., & Vishnoi, N. K.
- Venue
- 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
- Publisher
- IEEE
- Published
- 2005-11-15
- Pages
- 53-62
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W1571037334
- Cited by
- 263
- References
- 18
- FWCI
- 21.51
- Type
- conference paper
- Language
- en
- Open access
- green
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.