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.3247 m |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.3695 k + |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.
Currently the best algorithm is given in REF and solves this problem in O(1.37 k + |F |), where |F | is the size of the given formula.
Improved Exact Algorithms for MAX-SAT
LATIN
Mathematics Computer Science