Improved exact algorithms for MAX-SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2286, Issue , 2002, Pages 341-355

  Chen, Jianer ^a   Kanj, Iyad A ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

Exact algorithms; Maximum satisfiability; Parameterized algorithms

Indexed keywords

BOOLEAN ALGEBRA; FORMAL LOGIC; PARAMETERIZATION;

BOOLEAN FORMULAE; EXACT ALGORITHMS; LITERALS; MAXIMUM SATISFIABILITY; MAXIMUM SATISFIABILITY PROBLEMS; PARAMETERIZED ALGORITHM; TRUTH ASSIGNMENT;

PARAMETER ESTIMATION;

EID: 84937390616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_32     Document Type: Conference Paper

References (35)

1. J. Alber, H. L. Bodlaender, H. Fernau, and R. Niedermeier, Fixed parameter algorithms for dominating set and related problems on planar graphs, Lecture Notes in Computer Science 1851, (2000), pp. 97–110. Accepted for publication in Algorithmica
2. J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, and U. Stege, Refined search tree techniques for Dominating Set on planar graphs, Lecture Notes in Computer Science 2136, (2001), pp 111-122.
3. J. Alber, H. Fernau, and R. Niedermeier, Parameterized complexity: Exponential speed-up for planar graph problems, in Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP 2001), Lecture Notes in Computer Science 2076, (2001), pp 261-272.
4. T. Asano, K. Hori, T. Ono, and T. Hirata, A theoretical framwork of hybrid approaches to Max-Sat, Lecture Notes in Computer Science 1350, (1997), pp. 153-162.
5. T. Asano, and D. P. Williamson, Improved Aproximation Algorithms for Max-Sat, in Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), (2000), pp. 96-105.
6. P. Asirelli, M. de Santis, and A. Martelli, Integrity constraints in logic databases, Journal of Logic Programming 3, (1985), pp. 221-232.
7. R. Balasubramanian, M. R. Fellows, and V. Raman, An improved fixed parameter algorithm for vertex cover, Information Processing Letters 65, (1998), pp. 163-168.
8. N. Bansal and V. Raman, Upper bounds for Max-Sat further improved, Lecture Notes in Computer Science 1741, (1999), pp. 247-258.
9. R. Battiti and M. Protasi, Reactive research, a history base heuristic for Max-Sat, J. Exper. Algorithmics 2, No. 2, (1997)
10. R. Battiti and M. Protasi, Approximate algorithms and heuristics for Max-Sat, in Handbook of Combinatorial Optimization 1, D. Z. Du and P. M. Pardalos Eds., (1998), pp. 77-148.
11. B. Borchers and J. Furman, A two-phase exact algorithm for Max-Sat and weighted Max-Sat problems, J. Combinatorial Optimization 2, (1999), pp. 465-474.
12. R. Beigel, Finding mximum independent sets in sparse and general graphs, in Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA’99), (1999), pp. 856-857.
13. R. Beigel and D. Eppstein, 3-coloring in time O(1.3446n): a no-MIS algorithm, in Proceedings of the 36th IEEE Symposium on Foundation of Computer Science (FOCS’95), (1995), pp. 442-452.
14. L. Cai and J. Chen, On fixed-parameter tractability and approximation of NPhard optimization problems, Journal of Computer and System Sciences 54, (1997), pp. 465-474.
15. L. Cai and D. Juedes, On the existence of subexponential-time parameterized algorithms, available at http://www.cs.uga.edu/~cai/
16. J. Chen, D. K. Friesen, W. Jia, and I. A. Kanj, Using nondeterminism to design efficient deterministic algorithms, to appear in proceedings of the 21st annual conference on Foundations of Software Technology and Theoreical Computer Science (FSTTCS’01), December 13-15, (2001), Indian Institute of Science, Bangalore, India
17. J. Chen and I. A. Kanj, On constrained minimum vertex covers of bibartite graphs: Improved Algorithms, Lecture Notes in Computer Science
18. J. Chen, I. A. Kanj, and W. Jia, Vertex cover, further observations and further improvements, Lecture Notes in Computer Science 1665, (1999), pp. 313–324.
19. J. Chen, L. Liu, and W. Jia, Improvement on Vertex Cover for low-degree graphs, Networks 35, (2000), pp. 253-259.
20. R. G. Downey and M. R. Fellows, Parameterized Complexity, New York, New York: Springer, (1999)
21. R. G. Downey, M. R. Fellows, and U. Stege, Parameterized complexity: A framework for systematically confronting computational intractability, in Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, F. Roberts, J. Kratochvil, and J. Nesetril, eds., AMS-DIMACS Proceedings Series 49, AMS, (1999), pp. 49-99.
22. E. Dantsin, M. Goerdt, E. A. Hirsch, and U. Schöning, Deterministic algorithms for k-SAT based on covering codes and local search, Lecture Notes in Compuer Science 1853, (2000), pp. 236-247.
23. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7, (1960), pp. 201-215.
24. H. Fernau and R. Niedermeier, An efficient exact algorithm for constraint bipartite vertex cover, Journal of Algorithms 38, (2001), pp. 374-410.
25. H. Gallaire, J. Minker, and J. M. Nicolas, Logic and databases: A deductive approach, Computing Surveys 16, No. 2, (1984), pp. 153-185.
26. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
27. J. Gramm, E. A. Hirsch, R. Niedermeier, and P. Rossmanith, Newworstcase upper bounds for Max-2-Sat with application to Max-Cut, accepted for publication in Discrete Applied Mathematics (2001)
28. P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44, (1990) pp. 279-303.
29. F. Hayes, D. A. Waterman, and D. B. Lenat, Building Expert Systems, Reading Massachusetts: Addison Wesley, (1983)
30. O. Kullman and H. Luckhardt, Deciding propositional tautologies: Algorithms and their complexity, submitted for publication, available at http://cs-svr1.swan.ac.uk/csoliver/papers.html
31. M. Mahajan and V. Raman, Parameterizing above guaranteed values: Max-Sat and Max-Cut, Journal of Algorithms 31, (1999), pp. 335-354.
32. T. A. Nguyen, W. A. Perkins, T. J. Laffey, and D. Pecora, Checking an expert systems knowledge base for consistency and completeness, IJCAI’85, Arvind Joshi Ed., Los Altos, CA, (1983), pp. 375-378.
33. R. Niedermeier and P. Rossmanith, New upper bounds for maximum satisfiability, Journal of Algorithms 36, (2000), pp. 63-88.
34. J. M. Robson, Algorithms for maximum independent set, Journal of Algorithms 6, (1977), pp. 425-440.
35. R. J. Wallace, Enhancing maximum satisfiability algorithms with pure literal strategies, Lecture Notes on Artificial Intelligence 1081, (1996) pp. 388-401.