The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Optimal algorithms and inapproximability results for every CSP?
Abstract
Semidefinite Programming(SDP) is one of the strongest algorithmic techniques used in the design of approximation algorithms. In recent years, Unique Games Conjecture(UGC) has proved to be intimately connected to the limitations of Semidefinite Programming.
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
Some optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
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
Vertex 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
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
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
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
Noise stability of functions with low in.uences invariance and optimality
Mossel, E., O’Donnell, R., & Oleszkiewicz, K. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2005.53 · Cited by 132
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Lewin, M., Livnat, D., & Zwick, U. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47867-1_6 · Cited by 128
Near-optimal algorithms for unique games
Charikar, M., Makarychev, K., & Makarychev, Y. (2006) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1132516.1132547 · Cited by 124
Cited by
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Noise stability of functions with low influences: Invariance and optimality
Mossel, E., O’Donnell, R., & Oleszkiewicz, K. (2010) · Annals of Mathematics · doi:10.4007/annals.2010.171.295 · Cited by 288
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-06-17-479 · Cited by 269
Metadata
- Authors
- Raghavendra, P.
- Venue
- Proceedings of the fortieth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2008-05-17
- Pages
- 245-254
- OpenAlex
- W2110871651
- Cited by
- 384
- References
- 17
- FWCI
- 28.04
- 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: Optimal algorithms and inapproximability results for every CSP? https://app.cochat.ai/papers/10.1145/1374376.1374414
- The paper
- Raghavendra, P. (2008). Optimal algorithms and inapproximability results for every CSP? Proceedings of the fortieth annual ACM symposium on Theory of computing. https://doi.org/10.1145/1374376.1374414
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.