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

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

Documents Related by Co-Citation

10958 D.S.: Computers and Intractibility: A Guide to the Theory of NP-Completeness – M R Garey, Johnson - 1979
233 On the power of unique 2-prover 1-round games – Subhash Khot - 2002
934 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
645 Some optimal inapproximability results – Johan Håstad - 2002
127 The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into ℓ1 – Subhash A. Khot, Nisheeth K. Vishnoi - 2005
720 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
366 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
118 Vertex Cover Might be Hard to Approximate to within 2-ɛ – Subhash Khot, Oded Regev - 2003
318 A Parallel Repetition Theorem – Ran Raz - 1998