Optimal algorithms and inapproximability results for every CSP?

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 245-254

  Ragnavendra, Prasad ^a  

^a University of Washington   (United States)

Author keywords

Constraint satisfaction problem; Dictatorship tests; Rounding schemes; Semidefinite programming; Unique games conjecture

Indexed keywords

CONSTRAINT SATISFACTION PROBLEM; DICTATORSHIP TESTS; ROUNDING SCHEMES; SEMIDEFINITE PROGRAMMING; UNIQUE GAMES CONJECTURE;

COMPUTER OPERATING PROCEDURES; CONSTRAINT THEORY; DEMODULATION; GAME THEORY; HARDNESS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROGRAMMING THEORY; STEELMAKING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 51849168818     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Per Austrin. Balanced max 2-sat might not be the hardest. In ACM STOC, pages 189-197. 2007.
2. Per Austrin. Towards sharp inapproxima bility for any 2-csp. In IEEE FOCS, pages 307-317. 2007.
3. Per Austrin, Elchannan Mossel. Approximation Resistant Predicates from Pairwise Independence. In IEEE CCC, 2008.
4. Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Near-optimal algorithms for maximum constraint satisfaction problems. In ACM-SIAM SODA 2007, pages 62-68. 2007.
5. Moses Charikar, Yury Makarychev, and Konstantin Makarychev. Near-optimal algorithms for unique games. In ACM STOC, pages 205-214. 2006.
6. Sourav Chatterjee. A simple invariance theorem, arxiv:math/0508213v1., 2005.
7. Eden Chlamtac, Yury Makarychev, and Konstantin Makarychev. How to play unique games using embeddings. In IEEE FOCS, pages 687-696. 2006.
8. Irit Dinur, Elchanan Mossel, and Oded Regev. Conditional hardness for approximate coloring. In ACM STOC, pages 344-353. 2006.
9. Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM, 42(6):1115-1145, 1995.
10. Johann Hastad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
11. Howard Karloff and Uri Zwick. A 7/8-approximation algorithm for MAX 3SAT? In IEEE FOCS, pages 406-415. 1997.
12. Subhash Khot. On the power of unique 2-prover 1-round games. In ACM STOC, pages 767-775. 2002.
13. Subhash Khot, Guy Kindler, Elchannan Mossel, and Ryan O'Donnell. Optimal inapproximability results for max-cut and other 2-variable CSPs? In IEEE FOCS, pages 146-154. 2004.
14. Subhash Khot and Ryan O'Donnell. SDP gaps and UGC-hardness for MAXCUTGAIN. In IEEE FOCS, pages 217-226. 2006.
15. Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within /spl epsi/. In IEEE CCC, volume 18, pages 379-386. 2003.
16. 1. In IEEE FOCS, pages 53-62. 2005.
17. Michael Lewin, Dror Livnat, and Uri Zwick. Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In IPCO, pages 67-82, 2002.
18. Elchanan Mossel. Gaussian bounds for noise correlation of functions, arxiv:math/0703683. 2007.
19. Elchannan Mossel. Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: Invariance and optimality. In IEEE FOCS, pages 21-30. 2005.
20. Alex Samorodnitsky and Luca Trevisan. Gowers uniformity, influence of variables, and PCPs. In ACM STOC, pages 11-20. 2006.
21. V.I.Rotar'. Limit theorems for polylinear forms. Journal of Multivariate Analysis, 9(4):511-530, 1979.