References analysis of the Wikipedia article "Unique games conjecture" in the English version

ams.org

mathscinet.ams.org

Even, G.; Naor, J.; Schieber, B.; Sudan, M. (1998), "Approximating minimum feedback sets and multicuts in directed graphs", Algorithmica, 20 (2): 151–174, doi:10.1007/PL00009191, MR 1484534, S2CID 2437790

Berger, Bonnie; Shor, Peter W. (1997), "Tight bounds for the maximum acyclic subgraph problem", Journal of Algorithms, 25 (1): 1–18, doi:10.1006/jagm.1997.0864, MR 1474592

Chor, Benny; Sudan, Madhu (1998), "A geometric approach to betweenness", SIAM Journal on Discrete Mathematics, 11 (4): 511–523 (electronic), doi:10.1137/S0895480195296221, MR 1640920.

Charikar, Moses; Guruswami, Venkatesan; Manokaran, Rajsekar (2009), "Every permutation CSP of arity 3 is approximation resistant", 24th Annual IEEE Conference on Computational Complexity, pp. 62–73, doi:10.1109/CCC.2009.29, MR 2932455, S2CID 257225.

Raghavendra, Prasad; Steurer, David (2010), "Graph expansion and the unique games conjecture" (PDF), STOC'10—Proceedings of the 2010 ACM International Symposium on Theory of Computing, Association for Computing Machinery, pp. 755–764, doi:10.1145/1806689.1806792, MR 2743325, S2CID 1601199

Arora, Sanjeev; Barak, Boaz; Steurer, David (2015), "Subexponential algorithms for unique games and related problems", Journal of the ACM, 62 (5): Art. 42, 25, doi:10.1145/2775105, MR 3424199, S2CID 622344. Previously announced at FOCS 2010.

O'Donnell, Ryan; Wright, John (2012), "A new point of NP-hardness for unique games", Proceedings of the 2012 ACM Symposium on Theory of Computing (STOC'12), New York: ACM, pp. 289–306, doi:10.1145/2213977.2214005, MR 2961512, S2CID 6737664.

arxiv.org

Brakensiek, Joshua; Huang, Neng; Zwick, Uri (2024). "Tight approximability of MAX 2-SAT and relatives, under UGC". ACM-SIAM Symposium on Discrete Algorithms. arXiv:2310.12911.

Karpinski, Marek; Schudy, Warren (2009), "Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems", Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 313–322, arXiv:0811.3244, doi:10.1145/1536414.1536458, ISBN 9781605585062, S2CID 6117694

berkeley.edu

people.eecs.berkeley.edu

Raghavendra, Prasad (2008), "Optimal algorithms and inapproximability results for every CSP?" (PDF), in Dwork, Cynthia (ed.), Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, Association for Computing Machinery, pp. 245–254, doi:10.1145/1374376.1374414, S2CID 15075197

doi.org

Khot, Subhash (2002), "On the power of unique 2-prover 1-round games", Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pp. 767–775, doi:10.1145/509907.510017, ISBN 1-58113-495-9, S2CID 207635974

Håstad, Johan (1999), "Some Optimal Inapproximability Results", Journal of the ACM, 48 (4): 798–859, doi:10.1145/502090.502098, S2CID 5120748.

Goemans, Michel X.; Williamson, David P. (1995), "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming", Journal of the ACM, 42 (6): 1115–1145, doi:10.1145/227683.227684, S2CID 15794408

Khot, Subhash; Kindler, Guy; Mossel, Elchanan; O'Donnell, Ryan (2007), "Optimal inapproximability results for MAX-CUT and other two-variable CSPs?" (PDF), SIAM Journal on Computing, 37 (1): 319–357, doi:10.1137/S0097539705447372, S2CID 2090495

Khot, Subhash; Minzer, Dor; Safra, Muli (2018), "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion", 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 592–601, doi:10.1109/FOCS.2018.00062, ISBN 978-1-5386-4230-6, S2CID 3688775

Dinur, Irit; Safra, Samuel (2005), "On the hardness of approximating minimum vertex cover" (PDF), Annals of Mathematics, 162 (1): 439–485, doi:10.4007/annals.2005.162.439, retrieved 2010-03-05.

Guruswami, Venkatesan; Manokaran, Rajsekar; Raghavendra, Prasad (2008), "Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph", 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 573–582, doi:10.1109/FOCS.2008.51, S2CID 8762205

Berger, Bonnie; Shor, Peter W. (1997), "Tight bounds for the maximum acyclic subgraph problem", Journal of Algorithms, 25 (1): 1–18, doi:10.1006/jagm.1997.0864, MR 1474592

Chor, Benny; Sudan, Madhu (1998), "A geometric approach to betweenness", SIAM Journal on Discrete Mathematics, 11 (4): 511–523 (electronic), doi:10.1137/S0895480195296221, MR 1640920.

Manurangsi, Pasin (2017), "Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis", in Chatzigiannakis, Ioannis; Indyk, Piotr; Kuhn, Fabian; Muscholl, Anca (eds.), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Leibniz International Proceedings in Informatics (LIPIcs), vol. 80, Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 79:1–79:14, doi:10.4230/LIPIcs.ICALP.2017.79, ISBN 978-3-95977-041-5

Khot, Subhash; Minzer, Dor; Safra, M. (October 2018), "Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion", 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 592–601, doi:10.1109/FOCS.2018.00062, ISBN 978-1-5386-4230-6, S2CID 3688775

semanticscholar.org

api.semanticscholar.org

Håstad, Johan (1999), "Some Optimal Inapproximability Results", Journal of the ACM, 48 (4): 798–859, doi:10.1145/502090.502098, S2CID 5120748.

simonsfoundation.org

Unique games conjecture (English Wikipedia)

ams.org

mathscinet.ams.org

arxiv.org

berkeley.edu

people.eecs.berkeley.edu

cornell.edu

cs.cornell.edu

doi.org

ieee.org

ieeexplore.ieee.org

kth.se

nada.kth.se

quantamagazine.org

rjlipton.wordpress.com

semanticscholar.org

api.semanticscholar.org

simonsfoundation.org

weizmann.ac.il

wisdom.weizmann.ac.il

windowsontheory.org