An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
A simplified NP-complete MAXSAT problem
Information Processing Letters
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Satisfiability - Algorithms and Logic
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
3-coloring in time 0(1.3446^n): a no-MIS algorithm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Solving satisfiability in less than 2n steps
Discrete Applied Mathematics
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Improved Parameterized Algorithms for Planar Dominating Set
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Exact Algorithms for MAX-SAT
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Faster Exact Solutions for MAX2SAT
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A tighter upper bound for random MAX 2-SAT
Information Processing Letters
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
Journal of Computer and System Sciences
Automated generation of simplification rules for SAT and MAXSAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A complete calculus for Max-SAT
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
MAX-SAT for formulas with constant clause density can be solved faster than in O(2n) time
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A new algorithm for parameterized MAX-SAT
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A note on the complexity of minimum dominating set
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Given a boolean CNF formula F of length |F| (sum of the number of variables in each clause) with m clauses on n variables, we prove the following results. --The MAXSAT problem, which asks for an assignment satisfying the maximum number of clauses of F, can be solved in O(1:341294m|F|) time. --The parameterized version of the problem, that is determining whether there exists an assignment satisfying at least k clauses of the formula (for some integer k), can be solved in O(k21:380278k + |F|) time. --MAXSAT can be solved in O(1:105729|F||F|) time. These bounds improve the recent bounds of respectively O(1:3972m|F|), O(k21:3995k + |F|) and O(1:1279|F||F|) due to Niedermeier and Rossmanith [11] for these problems. Our last bound comes quite close to the O(1:07578|F||F|) bound of Hirsch[6] for the Satisfiability problem (not MAXSAT).