MAX SAT approximation beyond the limits of polynomial-time approximation

Annals of Pure and Applied Logic

Volumn 113, Issue 1-3, 2001, Pages 81-94

  Dantsin, Evgeny ^a   Gavrilovich, Michael ^b   Hirsch, Edward A ^c   Konev, Boris ^c  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

^c STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

03B05; 03B25; 68W25; Approximation algorithms; Maximum satisfiability problem

Indexed keywords

EID: 0035960967     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(01)00052-5     Document Type: Article

References (21)

1. S. Arora, C. Lund, Hardness of approximation, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, Chap. 10., PWS Publishing Company, Boston, 1997.
2. T. Asano, D.P. Williamson, Improved approximation algorithms for MAX SAT, Proc. 11th Annu. ACM-SIAM Symp. on Discrete Algorithms, SODA'00, 2000, pp. 96-105.
3. N. Bansal, V. Raman, Upper bounds for MaxSat: further improved, in: A. Aggarwal, C. Pandu Rangan (Eds.), Proc. 10th Internat. Symp. on Algorithms and Computation, ISAAC'99, Lecture Notes in Computer Science, vol. 1741, Springer, Berlin, December 1999, pp. 247-258.
4. Borchers B., Furman J. A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. J. Combin. Optim. 2(4):1999;299-306.
5. E. Dantsin, Two propositional proof systems based on the splitting method. Zapiski Nauchnykh Seminarov LOMI 105 (1981) 24-44. (in Russian) (English translation: J. Soviet Math. 22 (3) (1983) 1293-1305.).
6. E. Dantsin, Two propositional proof systems based on the splitting method. Zapiski Nauchnykh Seminarov LOMI 105 (1981) 24-44. (in Russian) (English translation: J. Soviet Math. 22 (3) (1983) 1293-1305.).
7. E. Dantsin, M. Gavrilovich, E.A. Hirsch, B. Konev, Approximation algorithms for MAX SAT: a better performance ratio at the cost of a longer running time, Preprint 14/1998, Steklov Institute of Mathematics at St. Petersburg, May 1998, http://www.pdmi.ras.ru/preprint/1998/index.html.
8. E. Dantsin, A. Goerdt, E.A. Hirsch, U. Schöning, Deterministic algorithms for k -SAT based on covering codes and local search, in: U. Montanari, J.D.P. Rolim, E. Welzl (Eds.), Proc. 27th Internat. Colloq. on Automata, Languages and Programming, ICALP'2000, Lecture Notes in Computer Science, vol. 1853, Springer, Berlin, 2000.
9. Davis M., Logemann G., Loveland D. A machine program for theorem-proving. Comm. ACM. 5(7):1962;394-397.
10. U. Feige, M.X. Goemans, Approximating the value of two proper proof systems, with applications to MAX-2SAT and MAX-DICUT, Proc. 3rd Israel Symp. on Theory and Computing Systems, 1995, pp. 182-189.
11. Goemans M.X., Williamson D.P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM. 42(6):1995;1115-1145.
12. J. Gramm, E.A. Hirsch, R. Niedermeier, P. Rossmanith, New worst-case upper bounds for MAX-2-SAT with application to MAX-CUT. Technical Report 00-037, Electronic Colloquim on Computational Complexity, June 2000, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2000/TR00-037/index.html.
13. J. Håstad, Some optimal inapproximability results. Proc. 29th Annu. ACM Symp. on Theory of Computing, STOC'97, 1997, pp. 1-10.
14. Hirsch E.A. New worst-case upper bounds for SAT. J. Automat. Reason. 24(4):2000;397-420.
15. E.A. Hirsch, Worst-case time bounds for MAX- k -SAT w.r.t. the number of variables using local search, Proc. RANDOM 2000, ICALP Workshops 2000, Proc. in Informatics 8:69-76, Carleton Scientific 2000, Preliminary version available as Technical Report 00-019, Electronic Colloquim on Computational Complexity, 2000, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2000/TR00-019/index.html.
16. H. Karloff, U. Zwick, A 7/8-approximation algorithm for MAX 3SAT?, Proc. 38th Annu. IEEE Symp. on Foundations of Computer Science, FOCS'97, 1997, pp. 406-415.
17. O. Kullmann, H. Luckhardt, Deciding propositional tautologies: algorithms and their complexity, Preprint, January 1997, 82pp., http://www.cs.toronto.edu/ ̃kullmann.
18. Mahajan M., Raman V. Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms. 31:1999;335-354.
19. n steps Discrete Appl. Math. 10:1985;287-295.
20. R. Niedermeier, P. Rossmanith, New upper bounds for MaxSat, J. Algorithms, 2000, in preparation. (Preliminary version appeared in Proc. ICALP'99.).
21. U. Schöning, A probabilistic algorithm for k -SAT and constraint satisfaction problems, Proc. 40th Annu. IEEE Symp. on Foundations of Computer Science, FOCS'99, 1999, pp. 410-414.