Approximating MAX kCSP using random restrictions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 151-162

  Hast, Gustav ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; CONSTRAINT SATISFACTION PROBLEMS; OPTIMIZATION;

APPROXIMABILITY; APPROXIMATION RATIOS; CIRCUIT COMPLEXITY; COMPLEXITY CLASS; MAX KCSP; PROBABILISTIC APPROXIMATION; RANDOM RESTRICTIONS; SEMIDEFINITE RELAXATION;

APPROXIMATION ALGORITHMS;

EID: 33645617671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_14     Document Type: Article

References (16)

1. Mihir Bellare, Oded Goldreich, and Madhu Sudan. Free bits, PCPs, and nonapproximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, 1998.
2. Lars Engebretsen and Jonas Holmerin. More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. Unpublished manuscript, 2003.
3. Uriel Feige and Michel X. Goemans. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. Proceedings of the 3rd Symposium on Theory of Computing and Systems, 182-189, 1995.
4. Merrick Furst, James Saxe, and Michael Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13-27, 1984.
5. Michel X. Goemans and David P. Williamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM, 42:1115-1145, 1995.
6. Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, and Luca Trevisan. A tight characterization of NP with 3 query PCPs. Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 8-17, 1998.
7. Eran Halperin and Uri Zwick. Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs. Journal of Algorithms, 40:185-211, 2001.
8. Howard Karloff and Uri Zwick. A 7/8-approximation algorithm for MAX 3SAT? Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 406-415, 1997.
9. Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, and Umesh Vazirani. On syntactic versus computational views of approximability. SIAM Journal on Computing, 28(1):164-191, 1999.
10. Sanjeev Mahajan and H. Ramesh. Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing, 28(5):1641-1663, 1999.
11. Alex Samorodnitsky and Luca Trevisan. A PCP characterization of NP with optimal amortized query complexity. Proceedings of the 32nd ACM Symposium on Theory of Computing, 191-199, 2000.
12. Luca Trevisan. Parallel approximation algorithms by positive linear programming. Algorithmica, 21(1):72-88, 1998.
13. Luca Trevisan. Approximating satisfiable satisfiability problems. Algorithmica, 28(1):145-172, 2000.
14. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, and David P. Williamson. Gadgets, approximation, and linear programming. SIAM Journal on Computing, 29:2074-2097, 2000.
15. Uri Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 201-210, 1998.
16. Uri Zwick. Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans. Manuscript, 2000.