A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between

Journal of Computer and System Sciences

Volumn 78, Issue 1, 2012, Pages 305-335

  Gaspers, Serge ^a   Sorkin, Gregory B ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Constraint satisfaction; Convex programming; Exponential time algorithm; Hybrid instances; Measure and conquer; Polynomial space; Satisfiability

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; CONVEX OPTIMIZATION;

CONSTRAINT SATISFACTION; EXPONENTIAL TIME ALGORITHM; HYBRID INSTANCES; MEASURE AND CONQUER; POLYNOMIAL SPACE; SATISFIABILITY;

MIXTURES;

EID: 81955168094     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2011.05.010     Document Type: Conference Paper

References (23)

1. n) J. Algorithms 54 2 2005 168 204
2. Paul Bonsma, and Daniel Lokshtanov Feedback vertex set in mixed graphs Proceedings of the 12th Algorithms and Data Structures Symposium (WADS 2011) Lecture Notes in Comput. Sci. vol. 6844 2011 Springer 122 133
3. Nikhil Bansal, and Venkatesh Raman Upper bounds for MaxSat: Further improved Proceedings of the 10th International Symposium on Algorithms and Computation (ISAAC 1999) Lecture Notes in Comput. Sci. vol. 1741 1999 Springer 247 258
4. David Eppstein Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms ACM Trans. Algorithms 2 4 2006 492 509 (Pubitemid 46174058)
5. Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch A measure & conquer approach for the analysis of exact algorithms J. ACM 56 5 2009 1 32
6. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, and Peter Rossmanith Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT Discrete Appl. Math. 130 2 2003 139 155
7. Serge Gaspers, and Gregory B. Sorkin A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between Proceedings of the 20th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009) 2009 SIAM 606 615
8. Edward A. Hirsch A new algorithm for MAX-2-SAT Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000) Lecture Notes in Comput. Sci. vol. 1770 2000 Springer 65 73
9. Arist Kojevnikov, and Alexander S. Kulikov A new approach to proving upper bounds for MAX-2-SAT Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006) 2006 ACM 11 17 (Pubitemid 43275219)
10. Alexander S. Kulikov, and Konstantin Kutzkov New bounds for MAX-SAT by clause learning Proceedings of the 2nd International Symposium on Computer Science in Russia (CSR 2007) Lecture Notes in Comput. Sci. vol. 4649 2007 Springer 194 204 (Pubitemid 350271269)
11. Joachim Kneis, Daniel Mölle, Stefan Richter, and Peter Rossmanith Algorithms based on the treewidth of sparse graphs Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005) Lecture Notes in Comput. Sci. vol. 3787 2005 Springer 385 396 (Pubitemid 43848630)
12. Mikko Koivisto Optimal 2-constraint satisfaction via sum-product algorithms Inform. Process. Lett. 98 1 2006 24 28 (Pubitemid 43199781)
13. Joachim Kneis, Peter Rossmanith, A new satisfiability algorithm with applications to Max-Cut, Tech. Report AIB-2005-08, Department of Computer Science, RWTH Aachen, 2005.
14. Oliver Kullmann Worst-Case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 35 1997 American Mathematical Society pp. 261-313
15. Oliver Kullmann New methods for 3-SAT decision and worst-case analysis Theoret. Comput. Sci. 223 1-2 1999 1 72 (Pubitemid 129609093)
16. Rolf Niedermeier, and Peter Rossmanith New upper bounds for maximum satisfiability J. Algorithms 36 1 2000 63 88
17. Daniel Raible, and Henning Fernau A new upper bound for Max-2-SAT: A graph-theoretic approach Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008) Lecture Notes in Comput. Sci. vol. 5162 2008 Springer 551 562
18. Alexander D. Scott, and Gregory B. Sorkin Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2003) Lecture Notes in Comput. Sci. vol. 2764 2003 Springer 382 395
19. Alexander D. Scott, Gregory B. Sorkin, A faster exponential-time algorithm for Max 2-Sat, Max Cut, and Max k-Cut, Tech. Report RC23456 (W0412-001), IBM Research Report, December 2004, see http://domino.research.ibm. com/library/cyberdig.nsf.
20. Alexander D. Scott, and Gregory B. Sorkin Linear-programming design and analysis of fast algorithms for Max 2-CSP Discrete Optim. 4 3-4 2007 260 287 (Pubitemid 350167029)
21. Alexander D. Scott, Gregory B. Sorkin, Polynomial constraint satisfaction: A framework for counting and sampling CSPs and other problems, Tech. Report cs:DM/0604079v3, arxiv.org, February 2007, see http://arxiv.org/ abs/cs.DM/0604079.
22. Magnus Wahlström Exact algorithms for finding minimum transversals in rank-3 hypergraphs J. Algorithms 51 2 2004 107 121
23. Ryan Williams A new algorithm for optimal 2-constraint satisfaction and its implications Theoret. Comput. Sci. 348 2-3 2005 357 365