Dealing with 4-variables by resolution: An improved MaxSAT algorithm

We study techniques for solving the Maximum Satisfiability problem (MaxSAT). Our focus is on variables of degree 4. We identify cases for degree-4 variables and show how the resolution principle and the kernelization techniques can be nicely integrated to achieve more efficient algorithms for the Ma...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 670; pp. 33 - 44
Main Authors:	Chen, Jianer, Xu, Chao, Wang, Jianxin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 29.03.2017
Subjects:	Branch and bound Maximum satisfiability Parameterized algorithm The resolution principle Maximum satisfiability Parameterized algorithm Branch and bound The resolution principle
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!