Best possible approximation algorithm for max sat with cardinality constraint

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

Volumn 1444, Issue , 1998, Pages 193-199

  Sviridenko, Maxim I ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

CARDINALITY CONSTRAINTS; MAX-SAT; MAX-SAT PROBLEMS; PERFORMANCE GUARANTEES;

APPROXIMATION ALGORITHMS;

EID: 84958981546     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0053975     Document Type: Conference Paper

References (10)

1. Alon, N., Spencer, J.H.: Probabilistic Method. Wiley, 1992.
2. Asano, T.: Approximation algorithms for MAX SAT: Yannakakis vs. Goemans- Williamson. In Proceedings of the 5nd Israel Symposium on Theory and Computing Systems (1997) 182-189
3. Goemans, M., Williamson, D.: New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics 7 (1994) 656-666
4. Goemans M., Williamson, D.: Imroved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Journal of ACM 42 (1995) 1115-1145
5. Feige, U.: A threshold of In n for approximating set cover. Journal of ACM (to appear)
6. Feige, U., Goemans, M.: Approximating the value of two-prover proof systems, with applications to MAX 2-SAT and MAX-DICUT. In Proceedings of the 3nd Israel Symposium on Theory and Computing Systems (1995) 182-189
7. Feller, W.: An Introduction to Probability Theory and Its Applications. John Wiley & Sons New York (1968)
8. Hastad, J.: Some optimal inapproximability results. In Proceedings of the 28 Annum ACM Symp. on Theory of Computing (1996) 1-10
9. Karloff, H., Zwick, U.: A 7/8-approximation algorithm for MAX 3SAT? In Proceedings of the 38th FOCS (1997) 406-415
10. Khanna, S., Motwani, R.: Towards syntactic characterization of PTAS. In Proceedings of the 28 Annual ACM Symp. on Theory of Computing (1996) 329-337