On bounded occurrence constraint satisfaction

Information Processing Letters

Volumn 74, Issue 1, 2000, Pages 1-6

  Håstad, Johan ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

CONSTRAINT SATISFACTION PROBLEMS; NONTRIVIAL POLYNOMIAL TIME APPROXIMATION ALGORITHMS;

CONSTRAINT THEORY;

EID: 0342955712     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00032-6     Document Type: Article

References (11)

1. G. Andersson, L. Engebretsen, J. Håstad, A new way to use semidefinite programming with applications to linear equations mod p, in: Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 41-50.
2. G. Ausiello, Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation, Springer, Berlin, 1999.
3. P. Berman, M. Karpinski, On some tighter inapproximability results, in: J. Widermann, P.V.E. Boas, M. Nielsen (Eds.), Proceedings of ICALP 99, Springer Lecture Notes in Computer Sci., Vol. 1644, Springer, Berlin, pp. 200-209.
4. U. Feige, A threshold of Inn for approximating set cover, J. ACM 45 (1998) 634-652.
5. U. Feige, M. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, in: Proc. 3rd Israeli Symposium on the Theory of Computing and Systems, 1995, pp. 182-189.
6. M. Goemans, D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995) 1115-1145.
7. J. Håstad, Some optimal inapproximability results, in: Proc. 29th Annual ACM Symposium on Theory of Computation, El Paso, TX, 1997, pp. 1-10.
8. D.S. Johnsson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974) 256-278.
9. C. Papadimitriou, M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
10. L. Trevisan, Personal communication.
11. U. Zwick, Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint, in: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 201-210.