Integrity constraints in logic databases
Journal of Logic Programming
A simplified NP-complete MAXSAT problem
Information Processing Letters
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Improved Exact Algorithms for MAX-SAT
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
Automated generation of simplification rules for SAT and MAXSAT
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
Exact Max 2-Sat: Easier and Faster
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
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
ACM SIGACT News
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Journal of Discrete Algorithms
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
A new upper bound for Max-2-SAT: A graph-theoretic approach
Journal of Discrete Algorithms
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
Journal of Computer and System Sciences
Maximum independent set in graphs of average degree at most three in O(1.08537n)
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
New upper bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the average variable degree
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Discrete Optimization
New bounds for MAX-SAT by clause learning
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
In this paper we present a new approach to proving upper bounds for the maximum 2-satisfiability problem (MAX-2-SAT). We present a new 2K/5.5-time algorithm for MAX-2-SAT, where K is the number of clauses in an input formula. We also obtain a 2N/6 bound, where N is the number of variables in an input formula, for a particular case of MAX-2-SAT, where each variable appears in at most three 2-clauses. This immediately implies a 2N/6 bound, where N is the number of vertices in an input graph, for the independent set problem on 3-regular graphs. The key point of our improvement is a combined complexity measure for estimating the running time of an algorithm. By using a new complexity measure we are able to provide a much simpler proof of new upper bounds for MAX-2-SAT than proofs of previously known bounds.