A new algorithm for parameterized MAX-SAT

Authors:
Ivan Bliznets;Alexander Golovnev
Affiliations:
St. Petersburg University of the Russian Academy of Sciences, St. Petersburg, Russia;St. Petersburg University of the Russian Academy of Sciences, St. Petersburg, Russia
Venue:
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Year:
2012

Citing 10
Cited 0

On the approximation of maximum satisfiability

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Parameterizing above guaranteed values: MaxSat and MaxCut

Journal of Algorithms
Complexity of Partial Satisfaction

Journal of the ACM (JACM)
Upper Bounds for MaxSat: Further Improved

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Improved Exact Algorithms for MAX-SAT

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
New Upper Bounds for MaxSat

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Exact algorithms for dominating set

Discrete Applied Mathematics
Solving MAX-r-SAT Above a Tight Lower Bound

Algorithmica
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications

Algorithmica - Special Issue: Parameterized and Exact Computation, Part I
New bounds for MAX-SAT by clause learning

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to check whether at least k clauses of an input formula in CNF can be satisfied in time O*(1.358k). This improves the bound O*(1.370k) proved by Chen and Kanj more than 10 years ago. Though the presented algorithm is based on standard splitting techniques its core are new simplification rules that often allow to reduce the size of case analysis. Our improvement is based on a simple algorithm for a special case of MAX-SAT where each variable appears at most 3 times.