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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 606-615

  Gaspers, Serge ^a   Sorkin, Gregory B ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; NONLINEAR PROGRAMMING;

ARBITRARY MIXTURES; BOOLEAN VARIABLES; CLAUSE LEARNING; EXPONENTIAL TIME; HAND IN HANDS; NONLINEAR PROGRAMS; OBJECTIVE FUNCTIONS; POLYNOMIAL SPACE;

MIXTURES;

EID: 70349131137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.67     Document Type: Conference Paper

References (19)

1. N. Bansal and V. Raman, Upper bounds for MaxSat: Further improved, Proc. ISAAC 1999, LNCS 1741, Springer, pp. 247-258.
2. D. Eppstein, Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms, ACM Trans. Algorithms 2 (2006), no.4, 492-509. (Pubitemid 46174058)
3. F. V. Fomin, F. Grandoni, and D. Kratsch, Measure and conquer: Domination - a case study, Proc. ICALP 2005, LNCS 3580, Springer, pp. 191-203. (Pubitemid 41436101)
4. 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 Appl. Math. 130 (2003), no.2, 139-155.
5. E. A. Hirsch, A new algorithm for MAX-2-SAT, Proc. STACS 2000, LNCS 1770, Springer, pp. 65-73.
6. J. Kneis, D. Molle, S. Richter, and P. Rossmanith, Algorithms based on the treewidth of sparse graphs, Proc. WG 2005, LNCS 3787, Springer, pp. 385-396. (Pubitemid 43848630)
7. J. Kneis and P. Rossmanith, A new satisfiability algorithm with applications to Max-Cut, Tech. Report AIB-2005-2008, Department of Computer Science, RWTH Aachen, 2005.
8. M. Koivisto, Optimal 2-constraint satisfaction via sum-product algorithms, Inf. Proc. Letters 98 (2006), no.1, 24-28.
9. A. Kojevnikov and A. S. Kulikov, A new approach to proving upper bounds for MAX-2-SAT, Proc. SODA 2006, ACM, pp. 11-17. (Pubitemid 43275219)
10. A. S. Kulikov and K. Kutzkov, New bounds for MAX-SAT by clause learning, Proc. CSR 2007, LNCS 4649, Springer, pp. 194-204.
11. O. Kullmann, New methods for 3-SAT decision and worst-case analysis, Theoret. Comput. Sci. 223 (1999), no.1-2, 1-72. (Pubitemid 129609093)
12. -, Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol.35, Amer. Math. Soc., 1997, pp. 261-313.
13. R. Niedermeier and P. Rossmanith, New upper bounds for maximum satisfiability, J. Algorithms 36 (2000), no.1, 63-88.
14. D. Raible and H. Fernau, A new upper bound for Max-2-SAT: A graph-theoretic approach, Tech. Report cs:DS/0803.3531v2, arxiv.org, 2008, see http://arxiv.org/abs/cs.DM/0803.3531.
15. A. D. Scott and G. B. Sorkin, Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances, Proc. RANDOM 2003, LNCS 2764, Springer, pp. 382-395. (Pubitemid 37224017)
16. -, A faster exponential-time algorithm for Max 2-Sat, Max Cut, and Max k-Cut, Tech. Report RC23456 (W0412-001), IBM Research Report, 2004, see http://domino.research.ibm.com/library/cyberdig.nsf.
17. -, Linear-programming design and analysis of fast algorithms for Max 2-CSP, Discrete Optim. 4 (2007), no.3-4, 260-287.
18. M. Wahlström, Exact algorithms for finding minimum transversals in rank-3 hypergraphs, J. Algorithms 51 (2004), no.2, 107-121.
19. R. Williams, A new algorithm for optimal 2-constraint satisfaction and its implications, Theoret. Comput. Sci. 348 (2005), no.2-3, 357-365. (Pubitemid 43300800)