A new approach to proving upper bounds for MAX-2-SAT

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 11-17

  Kojevnikov, Arist ^a   Kulikov, Alexander S ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; SET THEORY; THEOREM PROVING;

MAXIMUM 2-SATISFIABILITY PROBLEM (MAX-2-SAT);

PROBLEM SOLVING;

EID: 33244473449     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109559     Document Type: Conference Paper

References (16)

1. P. Asirelli, M. De Santis, and M. Martelli. Integrity constraints in logic databases. Journal of Logic Programming, 3:221-232, 1985.
2. N. Bansal and V. Raman. Upper bounds for MaxSat: Further improved. In Proceedings of ISAAC'99, pages 247-258, 1999.
3. J. Chen and I. Kanj. Improved exact algorithms for MAX-SAT. In Proceedings of the 5th LATIN, volume 2286 of LNCS, pages 341-355, 2002.
4. S. S. Fedin and A. S. Kulikov. Automated proofs of upper bounds on the running time of splitting algorithms. Zapiski nauchnykh seminarov POMI, 316:111-128, 2004.
5. F. V. Fomin and K. Høie. Pathwidth of cubic graphs and exact algorithms. Information Processing Letters, 2005. To appear.
6. H. Gallaire, J. Minker, and J.-M. Nicolas. Logic and databases: A deductive approach. ACM Computing Surveys, 16(2):153-185, June 1984.
7. J. Gramm, E. A. Hirsch, R. Niedermeier, and P. Rossmanith. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics, 130(2):139-155, 2003.
8. J. Kneis, D. MD. Mölle, S. Richter, and P. Rossmanith. Pathwidth of cubic graphs and exact algorithms. In Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, 2005. To appear.
9. J. Kneis and P. Rossmanith. A new satisfiability algorithm with applications to Max-Cut. Technical Report AIB-2005-08, Department of Computer Science, RWTH Aachen University, April 2005.
10. A. S. Kulikov. Automated generation of simplification rules for SAT and MAXSAT. In Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT 2005), volume 3569 of LNCS, pages 430-436. Springer Verlag, 2005.
11. O. Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223:1-72, 1997.
12. O. Kullmann and H. Luckhardt. Algorithms for SAT/TAUT decision based on various measures. Preprint, 1999.
13. R. Paturi, P. Pudlák, M. E. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science. (FOCS-98), pages 628-637, Palo Alto, CA, November 1998.
14. S. Poljak and Z. Tuza. Maximum cuts and largest bipartite subgraphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 20:181-244, 1995.
15. V. Raman, B. Ravikumar, and S. Srinivasa Rao. A simplified NP-complete MAXSAT problem. Information Processing Letters, 65(1): 1-6, 1998.
16. R. Williams. A new algorithm for optimal constraint satisfaction and its implications. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), volume 3142 of LNCS, pages 1227-1237. Springer Verlag, 2004.