Abstract
The maximum satisfiabitity problem (MAX SAT) is: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we present approximation algorithms for MAX SAT, including a 0.76544-approximation algorithm. The previous best approximation algorithm for MAX SAT was proposed by Goemans-Williamson and has a performance guarantee of 0.7584. Our algorithms are based on semidefinite programming and the 0.75-approximation algorithms of Yannakakis and Goemans-Williamson.
Cite
CITATION STYLE
Asano, T., Ono, T., & Hirata, T. (1996). Approximation algorithms for the maximum satisflability problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1097, pp. 100–111). Springer Verlag. https://doi.org/10.1007/3-540-61422-2_124
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
