Improved approximation algorithms for MAX SAT

Journal of Algorithms

Volumn 42, Issue 1, 2002, Pages 173-202

  Asano, Takao ^a   Williamson, David P ^b  

^a CHUO UNIVERSITY   (Japan)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATRIX ALGEBRA; RANDOM PROCESSES; VECTORS;

APPROXIMATION ALGORITHMS; MAXIMUM SATISFIABILITY PROBLEM; RANDOM TRUTH ASSIGNMENT; SEMIDEFINITE PROGRAMMING;

ALGORITHMS;

EID: 0036462085     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1202     Document Type: Article

References (17)

1. T. Asano, Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson, in "Proceedings of the 5th Israel Symposium on Theory of Computing and Systems," pp. 24-37, 1997.
2. T. Asano, T. Ono, and T. Hirata, Approximation algorithms for the maximum satisfiability problem, Nordic J. Comput. 3 (1996), 388-404.
3. J. Chen, D. Friesen, and H. Zheng, Tight bound on Johnson's algorithm for MAX SAT, J. Comput. System Sci. 58 (1999), 622-640.
4. U. Feige and Michel X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, in "Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems," pp. 182-189, 1995.
5. Michel X. Goemans and David P. Williamson, .878-approximation algorithms for MAX CUT and MAX 2SAT, in "Proceedings of the 26th ACM Symposium on the Theory of Computating," pp. 422-431, 1994.
6. Michel X. Goemans and David P. Williamson, New 3/4-approximation algorithms for the maximum satisfiability problem, SIAM J. Discrete Math. 7 (1994), 656-666.
7. Michel X. Goemans and David P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995), 1115-1145.
8. Johan Håstad, Some optimal inapproximability results, in "Proceedings of the 28th ACM Symposium on the Theory of Computing," pp. 1-10, 1997.
9. Erin Halperin and Uri Zwick, Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs, J. Algorithms 40, (2001), 184-211.
10. David S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974), 256-278.
11. Howard Karloff and Uri Zwick, A 7/8-approximation algorithm for MAX 3SAT? in "Proceedings of the 38th IEEE Symposium on the Foundations of Computer Science," pp. 406-415, 1997.
12. R. Kohli and R. Krishnamurti, Average performance of heuristics for satisfiability, SIAM J. Discrete Math. 2 (1989), 508-523.
13. K. Lieberherr and E. Specker, Complexity of partial satisfaction, J. ACM 28 (1981), 411-421.
14. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, and David P. Williamson, Gadgets, approximation, and linear programming, SIAM J. Comput. 29 (2000), 2074-2097.
15. Mihalis Yannakakis, On the approximation of maximum satisfiability, J. Algorithms 17 (1994), 475-502.
16. 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 31st ACM Symposium on the Theory of Computing," pp. 679-687, 1999.
17. Uri Zwick, Personal communication, 1999.