A New Algorithm for Parameterized MAX-SAT

DOI10.1007/978-3-642-33293-7_6zbMath1360.68494OpenAlexW34340600MaRDI QIDQ4899239

Alexander Golovnev, Ivan A. Bliznets

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_6

zbMATH Keywords

satisfiabilitymaximum satisfiabilityparameterized algorithmsexact algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (8)

Improved MaxSAT Algorithms for Instances of Degree 3 ⋮ Improved exact algorithms for mildly sparse instances of MAX SAT ⋮ Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms ⋮ Solving sparse instances of Max SAT via width reduction and greedy restriction ⋮ Dealing with 4-variables by resolution: an improved MaxSAT algorithm ⋮ Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment ⋮ An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses ⋮ A refined branching algorithm for the maximum satisfiability problem

This page was built for publication: A New Algorithm for Parameterized MAX-SAT