Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (2005)

by Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell
Citations:170 - 24 self

Documents Related by Co-Citation

238 On the power of unique 2-prover 1-round games – Subhash Khot - 2002
125 The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into ℓ1 – Subhash A. Khot, Nisheeth K. Vishnoi - 2005
648 Some optimal inapproximability results – Johan Håstad - 2002
119 Vertex Cover Might be Hard to Approximate to within 2-ɛ – Subhash Khot, Oded Regev - 2003
958 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
90 Noise stability of functions with low influences: invariance and optimality – Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz - 2005
718 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
73 On the Hardness of Approximating Multicut and Sparsest-Cut – Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar - 2005
365 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
41 On the distribution of the Fourier spectrum of boolean functions – J Bourgain - 2002
223 The Influence of Variables on Boolean Functions (Extended Abstract) – Jeff Kahn, Gil Kalai, Nathan Linial - 1988
86 Optimal algorithms and inapproximability results for every CSP – Prasad Raghavendra - 2008
50 Gowers uniformity, influence of variables, and PCPs – Alex Samorodnitsky, Luca Trevisan - 2006
324 A Parallel Repetition Theorem – Ran Raz - 1998
21 Approximating unique games – Anupam Gupta, Kunal Talwar - 2006
21 Towards Sharp Inapproximability For Any 2-CSP – Per Austrin - 2008
40 Near-optimal algorithms for Unique Games – Moses Charikar, Konstantin Makarychev, Yury Makarychev - 2006
23 Balanced max 2-sat might not be the hardest – Per Austrin - 2007
34 Approximation algorithms for unique games – Luca Trevisan