Improved exact algorithms for MAX-SAT

Discrete Applied Mathematics

Volumn 142, Issue 1-3 SPEC. ISS., 2004, Pages 17-27

  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

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NUMBER THEORY; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING;

EXACT ALGORITHMS; MAXIMUM SATISFIABILITY; PARAMETERIZED ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 3142639213     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.03.002     Document Type: Article

References (37)

1. Alber J., Bodlaender H.L., Fernau H., Kloks T., Niedermeier R. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica. 33:2002;461-493.
2. J. Alber, H. Fan, M.R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, U. Stege, Refined search tree technique for Dominating Set on planar graphs, in: Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Comput. Sci. 2136 (2001) 111-122.
3. T. Asano, K. Hori, T. Ono, T. Hirata, A theoretical framework of hybrid approaches to MAX-SAT, in: Proceedings of the 8th International Symposium on Algorithms and Computation (ISAAC 1997), Lecture Notes in Comput. Sci. 1350 (1997) 153-162.
4. T. Asano, D.P. Williamson, Improved Approximation Algorithms for MAX-SAT, in: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 96-105.
5. Asirelli P., de Santis M., Martelli A. Integrity constraints in logic databases. J. Log. Programming. 3:1985;221-232.
6. Balasubramanian R., Fellows M.R., Raman V. An improved fixed parameter algorithm for vertex cover. Inform. Process. Lett. 65:1998;163-168.
7. N. Bansal, V. Raman, Upper bounds for MAX-SAT further improved, in: Proceedings of the 10th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Comput. Sci. 1741 (1999) 247-258.
8. Battiti R., Protasi M. Reactive research, a history base heuristic for MAX-SAT. J. Exper. Algorithmics. 2(2):1997.
9. R. Battiti, M. Protasi, Approximate algorithms and heuristics for MAX-SAT, in: D.Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization 1, 1998, pp. 77-148.
10. Borchers B., Furman J. A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. J. Combin. Optimization. 2:1999;465-474.
11. R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 856-857.
12. Cai L., Chen J. On fixed-parameter tractability and approximation of NP-hard optimization problems. J. Comput. System Sci. 54:1997;465-474.
13. J. Chen, D.K. Friesen, W. Jia, I.A. Kanj, Using nondeterminism to design efficient deterministic algorithms, in: Proceedings of the 21st annual conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Lecture Notes in Comput. Sci. 2245 (2001) 120-131.
14. J. Chen,I.A. Kanj, On constrained minimum vertex covers of bipartite graphs: Improved Algorithms, in: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Comput. Sci. (LNCS) 2204 (2001) 55-65.
15. Chen J., Kanj I.A., Jia W. Vertex cover, further observations and further improvements. J. Algorithms. 41:2001;280-301.
16. Chen J., Liu L., Jia W. Improvement on Vertex Cover for low-degree graphs. Networks. 35:2000;253-259.
17. n algorithm for k -SAT based on local search Theoret. Comput. Sci. 289-1:2002;69-83.
18. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7:1960;201-215.
19. Downey R.G., Fellows M.R. Parameterized Complexity. 1999;Springer, New York.
20. R.G. Downey, M.R. Fellows, U. Stege, Parameterized complexity: a framework for systematically confronting computational intractability, in: F. Roberts, J. Kratochvíl, J. Nešetřil (Eds.), Contemporary Trends in Discrete Mathematics From DIMACS and DIMATIA to the Future, AMS-DIMACS Proceedings Series 49, AMS (1999) 49-99.
21. D. Eppstein, Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 329-337.
22. Fernau H., Niedermeier R. An efficient exact algorithm for constraint bipartite vertex cover. J. Algorithms. 38:2001;374-410.
23. Gallaire H., Minker J., Nicolas J.M. Logic and databases. A deductive approach Comput. Surveys. 16(2):1984;153-185.
24. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;Freeman, San Francisco.
25. J. Gramm, E.A. Hirsch, R. Niedermeier, P. Rossmanith, New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT, to appear in Discrete Applied Mathematics. A preliminary version appeared as technical report TR00-037 in the Electronic Colloquium on Computational Complexity (ECCC) 7(37) (2000).
26. J. Gramm, R. Niedermeier, Faster exact solutions for MAX-2-SAT, in: Proceedings of the 4th Italian Conference on Algorithms and Complexity (CIAC), Lecture Notes in Comput. Sci. 1767 (2000) 174-186.
27. Hansen P., Jaumard B. Algorithms for the maximum satisfiability problem. Computing. 44:1990;279-303.
28. Hayes F., Waterman D.A., Lenat D.B. Building Expert Systems. 1983;Addison-Wesley, Reading, MA.
29. Impagliazzo R., Paturi R., Zane F. Which Problems Have Strongly Exponential Complexity? J. Computer and System Sciences. 63-4:2001;512-530.
30. O. Kullmann, H. Luckhardt, Deciding propositional tautologies: Algorithms and their complexity, submitted for publication, available at http://cs-svr1.swan.ac.uk/~csoliver/papers.html .
31. Mahajan M., Raman V. Parameterizing above guaranteed values. MAX-SAT and MAX-CUT J. Algorithms. 31:1999;335-354.
32. T.A. Nguyen, W.A. Perkins, T.J. Laffey, D. Pecora, in: A. Joshi (Ed.), Checking an Expert Systems Knowledge Base for Consistency and Completeness, IJCAI'85, Los Altos, CA, 1985, pp. 375-378.
33. Niedermeier R., Rossmanith P. New upper bounds for maximum satisfiability. J. Algorithms. 36:2000;63-88.
34. Niedermeier R., Rossmanith P. A general method to speed up fixed-parameter-tractable algorithms. Inform. Process. Lett. 73:2000;125-129.
35. Robson J.M. Algorithms for maximum independent set. J. Algorithms. 6:1987;425-440.
36. R.J. Wallace, Enhancing maximum satisfiability algorithms with pure literal strategies, in: Proceedings of the 11th Canadian Conference on Artificial Intelligence (AI), Lecture Notes in Artif. Intell. 1081 (1996) 388-401.
37. R.J. Wallace, E.C. Feuder, Comparative studies of constraints satisfaction and Davis-Putnam algorithms for maximum satisfiability problems, in: D.S. Johnson, M.A. Tricks (Eds.), Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenges, DIMACS Series on Discrete Mathematics and Theoretical Computer Science 26, American Mathematical Society, Providence, RI, 1996.