Worst-case study of local search for MAX-k-SAT

Discrete Applied Mathematics

Volumn 130, Issue 2, 2003, Pages 173-184

  Hirsch, Edward A ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBABILITY;

EXPONENTS;

PROBLEM SOLVING;

EID: 0042014165     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00404-3     Document Type: Conference Paper

References (46)

1. Arora S., Lund C. Hardness of approximation. Hochbaum D. Approximation Algorithms for NP-hard Problems. 1997;PWS Publishing Company, Boston. (Chapter 10).
2. T. Asano, D.P. Williamson, Improved approximation algorithms for MAX SAT, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'00, 2000, pp. 96-105.
3. Bansal N., Raman V. Upper bounds for MaxSat: further improved. Aggarwal A., Pandu Rangan C. Proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC'99. Lecture Notes in Computer Science. Vol. 1741:December, 1999;247-258 Springer, Berlin.
4. R. Battiti, M. Protassi, Reactive search, a history-sensitive heuristic for MAX-SAT, ACM J. Exp. Algorithmics 2 (1997) (Paper 2).
5. R. Battiti, M. Protasi, Approximate algorithms and heuristics for MAX-SAT, in: Handbook of Combinatorial Optimization, Vol. 1, Kluwer Academic Publishers, Dordrecht, 1998, pp. 77-148.
6. R. Bayardo, R. Schrag, Using CSP look-back techniques to solve real-world SAT instances, in: Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'97, pp. 203-208.
7. E. Dantsin, Two propositional proof systems based on the splitting method, Zapiski Nauchnykh Seminarov LOMI 105 (1981) 24-44 (English translation: J. Soviet Math. 22(3) (1983) 1293-1305) (in Russian).
8. E. Dantsin, Two propositional proof systems based on the splitting method, Zapiski Nauchnykh Seminarov LOMI 105 (1981) 24-44 (English translation: J. Soviet Math. 22(3) (1983) 1293-1305) (in Russian).
9. E. Dantsin, M. Gavrilovich, E.A. Hirsch, B. Konev, MAX SAT approximation beyond the limits of polynomial-time approximation, Ann. Pure Appl. Logic 113 (1-3) 81-94.
10. Dantsin E., Goerdt A., Hirsch E.A., Schöning U. Deterministic algorithms for. k -SAT based on covering codes and local search Montanari U., Rolim J.D.P., Welzl E. Proceedings of the 27th International Colloquium on Automata, Languages and Programming. ICALP'2000, Lecture Notes in Computer Science. Vol. 1853:2000;236-243 Springer, Berlin.
11. n algorithm for k -SAT based on local search, Theoret. Comput. Sci., 2002, to appear.
12. Davis M., Logemann G., Loveland D. A machine program for theorem-proving. Comm. ACM. 5(7):1962;394-397.
13. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7(3):1960;201-215.
14. U. Feige, M.X. Goemans, Approximating the value of two proper proof systems, with applications to MAX-2SAT and MAX-DICUT, in: Proceedings of the Third Israel Symposium on Theory and Computing Systems, 1995, pp. 182-189.
15. I.P. Gent, T. Walsh, Towards an understanding of hill-climbing procedures for SAT, in: Proceedings of the 11th National Conference on Artificial Intelligence, AAAI'93, AAAI Press, New York, pp. 28-33.
16. I.P. Gent, T. Walsh, Unsatisfied variables in local search, in: J. Hallam (Ed.), Hybrid Problems, Hybrid Solutions, IOS Press, 1995, pp. 73-85.
17. J. Gramm, E.A. Hirsch, R. Niedermeier, P. Rossmanith, Worst-case upper bounds for MAX-2-SAT with application to MAX-CUT, Discrete Appl. Math., this issue. PII: S0166-218X(02)00402-X.
18. Gramm J., Niedermeier R. Faster exact solutions for Max-. 2 -Sat Bongiovanni G., Gambosi G., Petreschi R. Proceedings of the Fourth Italian Conference on Algorithms and Complexity, CIAC 2000. Lecture Notes in Computer Science. Vol. 1767:March 2000;174-186 Springer, Berlin.
19. Gu J., Purdom P.W., Franco J., Wah B.W. Algorithms for satisfiability (SAT) problem: a survey. Du D., Gu J., Pardalos P.M. The Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996). DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 35:1997;19-152 American Mathematical Society, Providence, RI.
20. Hansen P., Jaumard B. Algorithms for the maximum satisfiability problem. Computing. 44:1990;279-303.
21. J. Håstad, Some optimal inapproximability results, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC'97, 1997, pp. 1-10.
22. K/4 -time algorithm for MAX- 2 -SAT: corrected version. Technical Report 99-036, Revision 02, Electronic Colloquium on Computational Complexity, février 2000. Electronic address: ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1999/TR99-036/revisn02.ps.
23. E.A. Hirsch, A new algorithm for MAX- 2 -SAT, in: H. Reichel, S. Tison (Eds.), Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, STACS 2000, Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 65-73. (Contains an error, fixed in [21]).
24. Hirsch E.A. New worst-case upper bounds for SAT. J. Automat. Reason. 24(4):2000;397-420.
25. Hirsch E.A. SAT local search algorithms. worst-case study J. Automat. Reason. 24(1/2):2000;127-143.
26. Hirsch E.A., Kojevnikov A. Solving Boolean satisfiability using local search guided by unit clause elimination. Walsh T. Proceedings of the seventh International Conference on Principles and Practice of Constraint Programming, CP'01. Lecture Notes in Computer Science. Vol. 2239:2001;605-609 Springer, Berlin.
27. H.H. Hoos, On the run-time behaviour of stochastic local search algorithms for SAT, in: Proceedings of the 16th National Conference on Artificial Intelligence, AAAI'99, 1999, pp. 661-666.
28. Hoos H.H., Stützle T. Local search algorithms for SAT. an empirical evaluation J. Automat. Reason. 24(4):2000;421-481.
29. H. Karloff, U. Zwick, A 7/8-approximation algorithm for MAX 3SAT? in: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97, 1997, pp. 406-415.
30. Kautz H., Selman B., Jiang Y. A general stochastic approach to solving problems with hard and soft constraints. Du D., Gu J., Pardalos P.M. The Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996). DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 35:1997;573-586 American Mathematical Society, Providence, RI.
31. Mahajan M., Raman V. Parameterizing above guaranteed values. MaxSat and MaxCut J. Algorithms. 31:1999;335-354.
32. D. McAllester, B. Selman, H. Kautz, Evidence in invariants for local search, in: Proceedings of the AAAI'97, 1997, pp. 321-326.
33. r) steps, Technical Report Bericht No. 3/1979, Reihe Theoretische Informatik, Universität-Gesamthochschule-Paderborn, 1979.
34. n steps Discrete Appl. Math. 10:1985;287-295.
35. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: engineering an efficient SAT solver, in: Proceedings of the 39th Design Automation Conference, 2001, to appear.
36. Niedermeier R., Rossmanith P. New upper bounds for maximum satisfiability. J. Algorithms. 36:2000;63-88.
37. C.H. Papadimitriou, On selecting a satisfying truth assignment, in: Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91, 1991, pp. 163-169.
38. A.J. Parkes, J. Walser, Tuning local search for satisability testing, in: Proceedings of the 13th National Conference on Artificial Intelligence, AAAI'96, 1996, pp. 356-362.
39. R. Paturi, P. Pudlák, M.E. Saks, F. Zane, An improved exponential-time algorithm for k -SAT, in: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98, 1998, pp. 628-637.
40. Resende M.G.C., Pitsoulis L.S., Pardalos P.M. Approximate solution of weighted MAX-SAT problems using GRASP. Du D., Gu J., Pardalos P.M. The Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996). DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 35:1997;393-405 American Mathematical Society, Providence, RI.
41. U. Schöning, A probabilistic algorithm for k -SAT and constraint satisfaction problems, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, FOCS'99, 1999, pp. 410-414.
42. B. Selman, H.A. Kautz, B. Cohen, Noise strategies for improving local search, in: Proceedings of the 12th National Conference on Artificial Intelligence, AAAI'94, 1994, pp. 337-343.
43. Yannakakis M. On the approximation of maximum satisfiability. J. Algorithms. 17(3):1994;457-502.
44. L. Zhang, zChaff. An implementation of the Chaff solver. Available from http://www.ee.princeton.edu/̃chaff/zchaff.html.
45. U. Zwick, Finding almost satisfying assignments, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98, 1998, pp. 551-560.
46. U. Zwick, Computer assisted proof of spherical volume inequalities, Manuscript, 2001, p. 21.