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. © Springer-Verlag Berlin Heidelberg 2005.
Author supplied keywords
Cite
CITATION STYLE
Porschen, S. (2005). Solving minimum weight exact satisfiability in time O(20.2441n). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3827 LNCS, pp. 654–664). https://doi.org/10.1007/11602613_66
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
