In this paper we present improved exact and parameterized algorithms for the maximum satisfiability problem. In particular, we give an algorithm that computes a truth assignment for a boolean formula F satisfying the maximum number of clauses in time O(1.3247m|F|), where m is the number of clauses in F, and |F| is the sum of the number of literals appearing in each clause in F. Moreover, given a parameter k, we give an O(1.3695k k2 + |F|) parameterized algorithm that decides whether a truth assignment for F satisfying at least k clauses exists. Both algorithms improve the previous best algorithms by Bansal and Raman for the problem.
CITATION STYLE
Chen, J., & Kanj, I. A. (2002). Improved exact algorithms for MAX-SAT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2286, pp. 341–355). Springer Verlag. https://doi.org/10.1007/3-540-45995-2_32
Mendeley helps you to discover research relevant for your work.