Approximating MAX kCSP - Outperforming a random assignment with almost a linear factor

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 956-968

  Hast, Gustav ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; POLYNOMIALS; PROBABILITY;

APPROXIMATION ALGORITHMS; BOOLEAN VARIABLES; MAX KCSP;

COMPUTER SCIENCE;

EID: 26444605774     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_77     Document Type: Conference Paper

References (13)

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. Moses Charikar and Anthony Wirth. Maximizing quadratic programs: Extending Grothendieck's inequality. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 54-60, 2004.
3. Lars Engebretsen and Jonas Holmerin. More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. In Proceedings of STAGS 2005, Lecture Notes in Computer Science 3404, pages 194-205, 2005.
4. Venkatesan Guruswami, Daniel Lewin, Madhu Sudan, and Luca Trevisan. A tight characterization of NP with 3 query PCPs. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 8-17, 1998.
5. Gustav Hast. Approximating Max kCSP using random restrictions. In Proceedings of APPROX 2004, Lecture Notes in Computer Science 3122, pages 151-162, 2004.
6. Gustav Hast. Beating a Random Assignment. PhD thesis, Royal Institute of Technology, 2005.
7. Michael Lewin, Dror Livnat, and Uri Zwick. Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In Proceedings of 9th IPCO, Lecture Notes in Computer Science 2337, pages 67-82, 2002.
8. Sanjeev Mahajan and H. Ramesh. Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing, 28(5): 1641-1663, 1999.
9. Alex Samorodnitsky and Luca Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 191-199, 2000.
10. Luca Trevisan. Parallel approximation algorithms by positive linear programming. Algorithmica, 21(1):72-88, 1998.
11. Luca Trevisan. Approximating satisfiable satisfiability problems. Algorithmica, 28(1):145-172, 2000.
12. Uri Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 201-210, 1998.
13. Uri Zwick. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. In Proceedings of the 31st annual ACM symposium on Theory of computing, pages 679-687, 1999.