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

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

Active Bibliography

1 Threshold Phenomena and Influence with some perspectives from Mathematics – Gil Kalai, Shmuel Safra
The Approximability of Learning and Constraint Satisfaction Problems – Yi Wu - 2010
14 On the unique games conjecture – Subhash Khot - 2005
16 Computational Applications of Noise Sensitivity – Ryan William O’Donnell - 2003
21 A brief introduction to Fourier analysis on the Boolean cube – Ronald De Wolf - 2008
73 On the Hardness of Approximating Multicut and Sparsest-Cut – Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar - 2005
21 Towards Sharp Inapproximability For Any 2-CSP – Per Austrin - 2008
4 Approximating NP-hard Problems Efficient Algorithms and their Limits – Prasad Raghavendra - 2009
5 Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality – Elchanan Mossel, Oded Regev, Jeffrey E. Steif, Benny Sudakov
26 Inapproximability of combinatorial optimization problems – Luca Trevisan - 2004
4 Inapproximability of NP-complete problems, discrete fourier analysis, and geometry – Subhash Khot - 2004
55 On the hardness of approximating minimum vertex cover – Irit Dinur, Samuel Safra - 2005
29 Some Topics in Analysis of Boolean Functions – Ryan O'Donnell
5 BEATING THE RANDOM ORDERING IS HARD: EVERY ORDERING CSP IS APPROXIMATION RESISTANT – Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar, et al. - 2011
1 Efficient Approximation Algorithms for Some Semidefinite Programs – Hsueh-i Lu, N. Klein, Franco P. Preparata, Pascal Van Hentenryck - 1996
Scribe notes by Li-Yang TanContents – unknown authors - 2012
4 Maximally stable Gaussian partitions with discrete applications – Marcus Isaksson, Elchanan Mossel
27 Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph – Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra
38 Conditional hardness for approximate coloring – Irit Dinur, Elchanan Mossel, Oded Regev - 2006