Exact Algorithms for MAX-SAT (2003)
| Venue: | In 4th Int. Workshop on First order Theorem Proving |
| Citations: | 15 - 5 self |
BibTeX
@INPROCEEDINGS{Zhang03exactalgorithms,
author = {Hantao Zhang and Haiou Shen and Felip Manyk},
title = {Exact Algorithms for MAX-SAT},
booktitle = {In 4th Int. Workshop on First order Theorem Proving},
year = {2003},
publisher = {Electronic}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The maximum satisfiability problem (MAX-SAT) is stated as follows: Given Boolean formula in CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAX-SAT is MAX-SNP-complete and received much attention recently. One of the challenges posed by Alber, Gramm and Niedermeier in a recent survey paper asks: Can MAX-SAT be solved in less than 2 ' "steps"? Here, n is the number of different variables in the formula and a step may take polynomial time of the input. We answered this challenge positively by showing that popular algorithm based on branch-and-bound is bounded by O(b2 ') in time, where b is the maximum number of occurrences of any variable in the input.
