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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Applegate, D., Cook, W.: Solving large-scale matching problems. In: Johnson, D.S., McGeoch, C.C. (eds.) Algorithms for Network Flows and Matching Theory, pp. 557–576. American Mathematical Society, Providence (1993)
Byskov, J.M., Ammitzboll Madsen, B., Skjernaa, B.: New Algorithms for Exact Satisfiability, BRICS, Technical Report RS-03-30, University of Aarhus (2003)
Dahllöf, V., Jonsson, P.: An Algorithm for Counting Maximum Weighted Independent Sets and its Applications. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 292–298 (2002)
Dahllöf, V., Jonsson, P., Beigel, R.: Algorithms for four variants of the exact satisfiability problem. Theoretical Comp. Sci. 320, 373–394 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)
Monien, B., Speckenmeyer, E., Vornberger, O.: Upper Bounds for Covering Problems. Methods of Operations Research 43, 419–431 (1981)
Porschen, S.: On Some Weighted Satisfiability and Graph Problems. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 278–287. Springer, Heidelberg (2005)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th ACM Symposium on Theory of Computing, pp. 216–226 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porschen, S. (2005). Solving Minimum Weight Exact Satisfiability in Time O(20.2441n). In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_66
Download citation
DOI: https://doi.org/10.1007/11602613_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)