Abstract
We study techniques for solving the MaxSAT problem on instances in which the variable degree is bounded by 3. The problem is NP-hard. We show how resolution principle can be applied that converts an instance into an equivalent instance in which the CNF formula becomes a linear CNF formula. We then show how more efficient branching strategies can be applied on linear CNF formulas. As applications, we present two algorithms: one of running time O⁎(1.194k) that solves the parameterized version of the problem, and the other of running time O⁎(1.237n) that solves the optimization version of the problem, both significantly improving previous best upper bounds.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
