On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A simplified NP-complete MAXSAT problem
Information Processing Letters
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Upper Bounds for MaxSat: Further Improved
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A new upper bound for Max-2-SAT: A graph-theoretic approach
Journal of Discrete Algorithms
Exact MAX-2SAT solution via lift-and-project closure
Operations Research Letters
| Hi-index | 0.00 |
Given a boolean 2CNF formula F, the MAX2SAT problem is that of finding the maximum number of clauses satisfiable simultaneously. In the corresponding decision version, we are given an additional parameter k and the question is whether we can simultaneously satisfy at least k clauses. This problem is NP-complete. We improve on known upper bounds on the worst case running time of MAX2SAT, implying also new upper bounds for Maximum Cut. In particular, we give experimental results, indicating the practical relevance of our algorithms.