An approximation algorithm for MAX 3-SAT
In this paper we present a 0.80-approximation algorithm for MAX 3-SAT. Previously 0.75- or 0.755-approximation algorithms were known for MAX SAT. Thus, we make slight improvement by limiting MAX SAT to MAX 3-SAT. Since approximating MAX 3-SAT within 112/113 is NP-complete, our result means that the best approximation ratio is between 0.80 and 112/113.
Unable to display preview. Download preview PDF.
- 1.M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proc. 25th STOC, pages 294–304, 1993.Google Scholar
- 2.Michel X. Goemans and David P. Williamson. 878-approximation algorithms for MAX CUT and MAX 2SAT. In Proc. 26th STOC, pages 422–431, 1994.Google Scholar
- 3.Michel X. Goemans and David P. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal of Disc. Math., 7(4):656–666, November 1994.Google Scholar
- 4.David S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Comput. and Sys. Sci., 9:256–278, 1974.Google Scholar
- 5.Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. In Proc. 20th STOC, pages 229–234, 1988.Google Scholar
- 6.Pravin M. Vaidya. A new algorithm for minimizing convex function over convex sets. In Proc. 30th FOCS, pages 338–343, 1989.Google Scholar
- 7.Mihalis Yannakakis. On the approximation of maximum satisfiability. In Proc. 3rd SODA, pages 1–9, 1992.Google Scholar