Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
A New Algorithm for Parameterized MAX-SAT
verfasst von : Ivan Bliznets, Alexander Golovnev
Erschienen in: Parameterized and Exact Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We show how to check whether at least k clauses of an input formula in CNF can be satisfied in time
O
*
(1.358
k
). This improves the bound
O
*
(1.370
k
) 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.