On some weighted satisfiability and graph problems

Lecture Notes in Computer Science

Volumn 3381, Issue , 2005, Pages 278-287

  Porschen, Stefan ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

(weighted) exact satisfiability; Counting problem; Exact algorithm; Maximum weight independent set; Not all equal satisfiability; NP completeness

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

LINEAR TIME ALGORITHM; MAXIMUM WEIGHT INDEPENDENT SETS (MAX-IS); OPTIMIZATION PROBLEMS; WEIGHTED SATISFIABILITY PROBLEMS;

GRAPH THEORY;

EID: 24144453333     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30577-4_31     Document Type: Conference Paper

References (10)

1. A. V. Aho, M. Ganapathi, and S. W. Tjiang, Code Generation Using Tree Matching and Dynamic Programming, ACM Trans. Programming Languages and Systems, 11 (1989) 491-516.
2. D. Applegate and W. Cook, Solving large-scale matching problems, in: D. S. Johnson, C. C. McGeoch (Eds.), Algorithms for Network Flows and Matching Theory, American Mathematical Society, pp. 557-576, 1993.
3. S. A. Cook, The Complexity of Theorem Proving Procedures, in: Proceedings of the 3rd ACM symposium on Theory of Computing, pp. 151-158, 1971.
4. V. Dahllöf, P. Jonsson, 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.
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.
6. S. Liao, K. Kreutzer, S. W. Tjiang, and S. Devadas, A New Viewpoint on Code Generation for Directed Acyclic Graphs, ACM Trans. Design Automation of Electronic Systems, 3 (1998) 51-75.
7. D. Le Berre and L. Simon, The Essentials of the SAT 2003 Competition, in: E. Giunchiglia, A. Tacchella (Eds.), Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT'03), Lecture Notes in Computer Science, Vol. 2919, pp. 172-187, Springer-Verlag, Berlin, 2004; and references therein.
8. B. Monien, E. Speckenmeyer and O. Vornberger, Upper Bounds for Covering Problems, Methods of Operations Research 43 (1981) 419-431.
9. S. Porschen and E. Speckenmeyer, Satisfiability Problems for Mixed Horn Formulas, in: H. Kleine Büning, X. Zhao, (Eds.), Proceedings of the Guangzhou Symposium on Satisfiability and its Applications, 2004, Guangzhou, China 2004, pp. 106-113.
10. T. J. Schaefer, The complexity of satisfiability problems, in: Proceedings of the 10th ACM Symposium on Theory of Computing, pp. 216-226, 1978.