New upper bounds for maximum satisfiability
Journal of Algorithms
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Faster Exact Solutions for MAX2SAT
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
A new approach to proving upper bounds for MAX-2-SAT
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Algorithms based on the treewidth of sparse graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
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
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of ${\mathcal{O}}^*({2^{\frac{K}{6.2158}}})$ for Max-2-Sat(each clause contains at most 2 literals), where Kis the number of clauses. The run time has been achieved by using heuristic priorities on the choice of the variable on which we branch. The implementation of these heuristic priorities is rather simple, though they have a significant effect on the run time. Also the analysis uses a non-standard measure.