Approximation algorithms for the maximum satisflability problem

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

Volumn 1097, Issue , 1996, Pages 100-111

  Asano, Takao ^a   Ono, Takao ^b   Hirata, Tomio ^b  

^a CHUO UNIVERSITY   (Japan)

^b NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MAX-SAT; PERFORMANCE GUARANTEES; SEMI-DEFINITE PROGRAMMING; TRUTH ASSIGNMENT;

APPROXIMATION ALGORITHMS;

EID: 84947943128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_124     Document Type: Conference Paper

References (8)

1. U. Feige and Michel X. Goelnans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, In Proc. 3rd Israel Symposium on Theory of Computing and Systems, 1995, pp.182-189.
2. Michel X. Goemans and David P Williamson,.878-approxinlation algorithms for MAX CUT and MAX 2SAT, In Proc. 26th STOC, 1994, pp.422-431.
3. Michel X. Goemans and David P. Williamson, New 3/4-approximation algorithms for the maximum satisfiability problem, SIAM Journal of Disc. Math., 7 (1994), pp.656-666.
4. Michel X. Goemans and David P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, In Journal of the ACM, 42 (1995), pp.1115-1145.
5. David S. Johnson, Approximation algorithms for combinatorial problems, Journal of Comput. and Sys. Sci., 9 (1974), pp.256-278.
6. S. Mahajan and H. Ramesh, Correctly derandomizing Geomans and Williamson's MAX CUT algorithm, Unpublished manuscript, 1995
7. E. Tardos, A strongly polynomial algorithm for solving combinatoral linear program, Operations Research, 11 (1986), pp.250-256.
8. Mihalis Yannakakis, On the approximation of maximum satisfiability, in Proc. 3rd SODA, 1992, pp.1-9 (and also in J. Algorithms, 17 (1994), pp.475-502).