Improved exact algorithms for MAX-SAT (2002)
| Venue: | Discrete Applied Mathematics |
| Citations: | 14 - 1 self |
BibTeX
@INPROCEEDINGS{Chen02improvedexact,
author = {Jianer Chen and Iyad A. Kanj},
title = {Improved exact algorithms for MAX-SAT},
booktitle = {Discrete Applied Mathematics},
year = {2002},
pages = {341--355},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. Key words. maximum satisfiability, exact algorithms, parameterized algorithms. 1
