Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

Discrete Applied Mathematics

Volumn 130, Issue 2, 2003, Pages 139-155

  Gramm, Jens ^a   Hirsch, Edward A ^b   Niedermeier, Rolf ^a   Rossmanith, Peter ^c  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

BOOLEAN FORMULA;

PROBLEM SOLVING;

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

References (40)

1. S. Arora, C. Lund, Hardness of approximation, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, Chapter 10, PWS Publishing Company, Boston, 1997, pp. 399-446.
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. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. Complexity and Approximation - Combinatorial Optimization Problems and their Approximability Properties, Springer, Berlin, 1999.
4. N. Bansal, V. Raman, Upper bounds for MaxSat: further improved, in: A. Aggarwal, C. Pandu Rangan (Eds.), Proceedings of the 10th Annual Conference on Algorithms and Computation, ISAAC'99, Lecture Notes in Computer Science, Vol. 174, Springer, Berlin, 1999, pp. 247-258.
5. R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99, 1999, pp. 856-857.
6. P. Berman, M. Karpinski, On some tighter inapproximability results, in: Proceedings of the 26th International Colloquium on Automata, Languages and Programming, ICALP'99, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, 1999, pp. 200-209.
7. 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.
8. Cai L., Chen J. On fixed-parameter tractability and approximability of NP optimization problems. J. Comput. System Sci. 54:1997;465-474.
9. Cheriyan J., Cunningham W.H., Tunçel L., Wang Y. A linear programming and rounding approach to Max 2-Sat. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 26:1996;395-414.
10. 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.
11. 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.
12. Dantsin E., Gavrilovich M., Hirsch E.A., Konev B. MAX SAT approximation beyond the limits of polynomial-time approximation. Ann. Pure Appl. Logic. 113:2001;81-94.
13. n algorithm for k -SAT based on local search, Theoret. Comput. Sci. (2002), to appear.
14. E. Dantsin, A. Goerdt, E.A. Hirsch, U. Schöning, Deterministic algorithms for k -SAT based on covering codes and local search, in: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP'00, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 236-243.
15. Davis M., Logemann G., Loveland D. A machine program for theorem-proving. Comm. ACM. 5(7):1962;394-397.
16. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7(3):1960;201-215.
17. Downey R.G., Fellows M.R. Parameterized Complexity. 1999;Springer-Verlag, Berlin.
18. 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.
19. J. Gramm, Exact algorithms for Max2Sat and their applications, Diploma thesis, WSI für Informatik, Universität Tübingen, October 1999, available from http://www-fs.informatik.uni-tuebingen.de/̃gramm/publications/.
20. J. Gramm, R. Niedermeier, Faster exact solutions for Max-2-Sat, in: Proceedings of the Fourth Italian Conference on Algorithms and Complexity, CIAC 2000, Lecture Notes in Computer Science, Vol. 1767, Springer, Berlin, 2000, pp. 174-186.
21. J. Håstad, Some optimal inapproximability results, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC'97, Journal of the ACT 48 (2001) 798-859.
22. K/4 -time algorithm for MAX-2-SAT: Corrected version, Technical Report 99-036, Revision 02, Electronic Colloquim on Computational Complexity, February 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: Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, STACS 2000, Lecture Notes in Computer Science, Vol. 1770, Springer-Verlag, Berlin, February 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. E.A. Hirsch, Worst-case time bounds for MAX- k -SAT w.r.t. the number of variables using local search, in: Proceedings of RANDOM 2000, ICALP Workshops 2000, Proceedings in Informatics, Vol. 8, 2000, pp. 69-76.
26. 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.
27. Kullmann O. New methods for 3-SAT decision and worst-case analysis. Theoret. Comput. Sci. 223(1-2):1999;1-72.
28. O. Kullmann, H. Luckhardt, Algorithms for SAT/TAUT decision based on various measures. preprint, 71 pages, available from http://www.cs.toronto.edu/̃kullmann February 1999.
29. Mahajan M., Raman V. Parameterizing above guaranteed values. MaxSat and MaxCut J. Algorithms. 31:1999;335-354.
30. n steps Discrete Appl. Math. 10:1985;287-295.
31. Niedermeier R., Rossmanith P. New upper bounds for MaxSat. J. Algorithms. 36:2000;63-88.
32. Papadimitriou C.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
33. 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.
34. Poljak S., Tuza Z. Maximum cuts and large bipartite subgraphs. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 20:1995;181-244.
35. Raman V., Ravikumar B., Srinivasa Rao S. A simplified NP-complete MAXSAT problem. Inform. Process. Lett. 65(1):1998;1-6.
36. Robinson J.A. Generalized resolution principle. Mac. Intell. 3:1968;77-94.
37. 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.
38. R. Schuler, U. Schöning, O. Watnabe, T. Hofemister, A probabilistic {3-SAT} algorithm further improved, Proceedings of 19th International Symposium on Theoretical Aspects of Computer Science, STACS 2002, Lecture Notes in Computer Science, 2285, Springer, 2002, 192-202.
39. Yannakakis M. On the approximation of maximum satisfiability. J. Algorithms. 17(3):1994;457-502.
40. U. Zwick, personal communication, 2000.