Solving minimum weight exact satisfiability in time O(20.2441n)

Authors:
Stefan Porschen
Affiliations:
Institut für Informatik, Universität zu Köln, Köln, Germany
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 5
Cited 2

An algorithm for counting maximum weighted independent sets and its applications

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Algorithms for four variants of the exact satisfiability problem

Theoretical Computer Science
On some weighted satisfiability and graph problems

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Algorithms for variable-weighted 2-SAT and dual problems

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Counting all solutions of minimum weight exact satisfiability

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity

Quantified Score

Hi-index	0.01

Visualization

Abstract

We show that the NP-hard optimization problem minimum weight exact satisfiability for a CNF formula over n propositional variables equipped with arbitrary real-valued weights can be solved in time O(20.2441n). To the best of our knowledge, the algorithm presented here is the first handling the weighted XSAT optimization version in non-trivial worst case time.