Abstract
In the first part of this paper we address several weighted satisfiability problems. Among others, we provide linear time algorithms solving the optimization problems MINV(MAXV)-NAESAT and MINV (MAXV)-XSAT for 2CNF formulas and arbitrary real weights assigned to the variables. In a second part we consider the relationship between the problems maximum weight independent set (MAX-IS) in a graph and the problem XSAT. We show that the counting problem #XSAT can be solved in time O(20.40567n) thereby significantly improving on a bound O(20.81131n) provided in [4].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ganapathi, M., Tjiang, S.W.: Code Generation Using Tree Matching and Dynamic Programming. ACM Trans. Programming Languages and Systems 11, 491–516 (1989)
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)
Cook, S.A.: The Complexity of Theorem Proving Procedures. In: Proceedings of the 3rd ACM symposium on Theory of Computing, pp. 151–158 (1971)
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)
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)
Liao, S., Kreutzer, K., Tjiang, S.W., Devadas, S.: A New Viewpoint on Code Generation for Directed Acyclic Graphs. ACM Trans. Design Automation of Electronic Systems 3, 51–75 (1998)
Le Berre, D., Simon, L.: The Essentials of the SAT 2003 Competition. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 172–187. Springer, Heidelberg (2004)
Monien, B., Speckenmeyer, E., Vornberger, O.: Upper Bounds for Covering Problems. Methods of Operations Research 43, 419–431 (1981)
Porschen, S., Speckenmeyer, E.: Satisfiability Problems for Mixed Horn Formulas. In: Kleine Büning, H., Zhao, X. (eds.) Proceedings of the Guangzhou Symposium on Satisfiability and its Applications, Guangzhou, China, pp. 106–113 (2004) (to appear)
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). On Some Weighted Satisfiability and Graph Problems. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-30577-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24302-1
Online ISBN: 978-3-540-30577-4
eBook Packages: Computer ScienceComputer Science (R0)