Best possible approximation algorithm for MAX SAT with cardinality constraint

Algorithmica (New York)

Volumn 30, Issue 3, 2001, Pages 398-405

  Sviridenko, M I ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithm; Maximum satisfiability

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

CARDINALITY CONSTRAINTS;

COMPUTER SCIENCE;

EID: 0242364694     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0019-5     Document Type: Article

References (12)

1. A. Ageev and M. Sviridenko, Approximation algorithms for maximum coverage and max cut with given sizes of parts, in Proceedings of IPCO 99, Springer-Verlag, Berlin, Lecture Notes in Computer Science, vol. 1610, pp. 17-30.
2. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
3. T. Asano, Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson, in Proceedings of the 5th Israel Symposium on Theory and Computing Systems (1997), pp. 182-189.
4. M. Goemans and D. Williamson, New 3/4-approximation algorithms for the maximum satisfiability problem, SIAM Journal on Discrete Mathematics 7 (1994), 656-666.
5. M. Goemans and D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM 42 (1995), 1115-1145.
6. U. Feige, A threshold of In n for approximating set cover, Journal of the ACM 45 (1998), 634-652.
7. U. Feige and M. Goemans, Approximating the value of two-prover proof systems, with applications to MAX 2-SAT and MAX-DICUT, in Proceedings of the 3rd Israel Symposium on Theory and Computing Systems (1995), pp. 182-189.
8. W. Feller, An Introduction to Probability Theory and Its Applications, Wiley, New York, 1968.
9. D. Johnson and M. Trick, Cliques, Colorings and Satisfiability, American Mathematical Society, Providence, RI, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, 1996.
10. J. Håstad, Some optimal inapproximability results, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (1996), pp. 1-10.
11. H. Karloff and U. Zwick, A 7/8-approximation algorithm for MAX 3SAT?, in Proceedings of the 38th FOCS (1997), pp. 406-415.
12. S. Khanna and R. Motwani, Towards a syntactic characterization of PTAS, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (1996), pp. 329-337.