Is constraint satisfaction over two variables always easy?

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

Volumn 2483, Issue , 2002, Pages 224-238

  Engebretsen, Lars ^a   Guruswami, Venkatesan ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; RANDOM PROCESSES;

BOOLEAN DOMAIN; CONSTRAINT SATISFACTION; INTRIGUING QUESTIONS; IS APPROXIMATION; PERFORMANCE RATIO; RANDOM ASSIGNMENT; RESISTANCE PROPERTIES; SET SPLITTING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84959047593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45726-7_18     Document Type: Conference Paper

References (12)

1. Gunnar Andersson. Some New Randomized Approximation Algorithms. Doctoral dissertation, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, May 2000.
2. Gunnar Andersson, Lars Engebretsen, and Johan Håstad. A new way of using semidefinite programming with applications to linear equations mod p. Journal of Algorithms, 39 (2): 162-204, May 2001.
3. Alan Frieze and Mark Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica, 18: 67-81, 1997.
4. Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42 (6): 1115-1145, November 1995.
5. Michel X. Goemans and David P. Williamson. Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 443-452. Hersonissos, Crete, Grece, 6-8 July 2001.
6. Håstad J. Some optimal inapproximability results. Journal of the ACM, 48 (4): 798-859, July 2001.
7. Viggo Kann, Sanjeev Khanna, Jens Lagergren, and Alessandro Panconesi. On the hardness of approximating Max k-Cut and its dual. Chicago Journal of Theoretical Computer Science, 1997(2), June 1997.
8. Subhash Khot. Hardness results for coloring 3-colorable 3-uniform hypergraphs. To appear in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science. Vancouver, Canada, 16-19 November 2002.
9. Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 767-775. Montréal, Québec, Canada, 19-21 May 2002.
10. Erez Petrank. The hardness of approximation: Gap location. Computational Complexity, 4 (2): 133-157, 1994.
11. Uri Zwick. Approximation algorithms for constraint satisfaction programs involving at most three variables per constraint. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 201-210. San Francisco, California, 25-27 January 1998.
12. 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 Thirty-First Annual ACM Symposium on Theory of Computing, pages 679-687. Atlanta, Georgia, 1-4 May 1999.