A New Algorithm for Parameterized MAX-SAT

  • Ivan Bliznets
  • Alexander Golovnev
Conference paper

DOI: 10.1007/978-3-642-33293-7_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7535)
Cite this paper as:
Bliznets I., Golovnev A. (2012) A New Algorithm for Parameterized MAX-SAT. In: Thilikos D.M., Woeginger G.J. (eds) Parameterized and Exact Computation. IPEC 2012. Lecture Notes in Computer Science, vol 7535. Springer, Berlin, Heidelberg

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.

Keywords

exact algorithms maximum satisfiability parameterized algorithms satisfiability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ivan Bliznets
    • 1
  • Alexander Golovnev
    • 1
  1. 1.St. Petersburg University of the Russian Academy of SciencesSt. PetersburgRussia

Personalised recommendations