Linear-programming design and analysis of fast algorithms for Max 2-CSP

Discrete Optimization

Volumn 4, Issue 3-4, 2007, Pages 260-287

  Scott, Alexander D ^a   Sorkin, Gregory B ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

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

Author keywords

Exact algorithms; Linear programming duality; Max 2 CSP; Max 2 Sat; Max Cut; Measure and conquer

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; NUMERICAL METHODS; POLYNOMIALS;

CONSTRAINT SATISFACTION PROBLEMS; LINEAR PROGRAMMING DUALITY; MAX CUT; POLYNOMIAL SPACE ALGORITHM;

LINEAR PROGRAMMING;

EID: 36448951225     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2007.08.001     Document Type: Article

References (35)

1. Alon N., Kahn J., and Seymour P.D. Large induced degenerate subgraphs. Graphs Combin. 3 3 (1987) 203-211 MR903609 (88i:05104)
2. In: Arnborg S., Hedetniemi S.T., and Proskurowski A. (Eds). Efficient Algorithms and Partial k-trees. Discrete Appl. Math. 54 2-3 (1994) (special issue)
3. Arnborg S., and Proskurowski A. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23 1 (1989) 11-24
4. n). J. Algorithms 54 2 (2005) 168-204
5. Creignou N. A dichotomy theorem for maximum generalized satisfiability problems. 24th Annual ACM Symposium on the Theory of Computing, Victoria, BC. J. Comput. System Sci. 51 3 (1995) 511-522 1992. MR1368916 (97a:68076)
6. Croce F.D., Kaminski M.J., and Paschos V.Th. An exact algorithm for MAX-CUT in sparse graphs. Oper. Res. Lett. 35 3 (2007) 403-408
7. Vilhelm Dahllöf, Peter Jonsson, An algorithm for counting maximum weighted independent sets and its applications, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, January 2002
8. Dahllöf V., Jonsson P., and Wahlström M. Counting models for 2SAT and 3SAT formulae. Theoret. Comput. Sci. 332 1-3 (2005) 265-291 MR2122506 (2005j:68055)
9. Dechter R., and Pearl J. Network-based heuristics for constraint-satisfaction problems. Artif. Intell. 34 1 (1987) 1-38
10. Dechter R., and Pearl J. Tree clustering for constraint networks (research note). Artif. Intell. 38 3 (1989) 353-366
11. Eppstein D. Quasiconvex analysis of backtracking algorithms. Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 2004 (2004), ACM, New York 781-790
12. Fomin F.V., Grandoni F., and Kratsch D. Some new techniques in design and analysis of exact (exponential) algorithms. Bull. Eur. Assoc. Theor. Comput. Sci. 87 (2005) 47-77
13. Fomin F.V., and Høie K. Pathwidth of cubic graphs and exact algorithms. Inform. Process. Lett. 97 5 (2006) 191-196 MR2195217 (2006g:05199)
14. Martin Fürer, Shiva Prasad Kasiviswanathan, Algorithms for counting 2-SAT solutions and colorings with applications, Tech. Report TR05-033, Electronic Colloquium on Computational Complexity, March 2005, See http://www.eccc.uni-trier.de/eccc/
15. Furer M., and Kasiviswanathan S.P. Exact Max 2-SAT: Easier and faster. Proceedings of SOFSEM 2007. LNCS 4362 (2007), Springer
16. Gramm J., Hirsch E.A., Niedermeier R., and Rossmanith P. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Appl. Math. 130 2 (2003) 139-155 MR2014655 (2004j:68077)
17. Hirsch E.A. A new algorithm for MAX-2-SAT. STACS 2000, Lille. Lecture Notes in Comput. Sci. vol. 1770 (2000), Springer, Berlin 65-73
18. Jansen K., Karpinski M., Lingas A., and Seidel E. Polynomial time approximation schemes for max-bisection on planar and geometric graphs. SIAM J. Comput. 35 1 (2005) 110-119 (electronic). MR2178800 (2006f:68143)
19. | E | / 4. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 293 7 (2002) 129-138, 183 Teor. Slozhn. Vychisl
20. Kojevnikov A., and Kulikov A.S. A new approach to proving upper bounds for MAX-2-SAT. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, 2006 (2006), ACM, New York 11-17
21. Kneis J., Mölle D., Richter S., and Rossmanith P. Algorithms based on the treewidth of sparse graphs. Graph-Theoretic Concepts in Computer Science. Lecture Notes in Comput. Sci. vol. 3787 (2005), Springer, Berlin 385-396 MR2213887
22. 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
23. Khanna S., Sudan M., Trevisan L., and Williamson D.P. The approximability of constraint satisfaction problems. SIAM J. Comput. 30 6 (2001) 1863-1920 (electronic). MR1856561 (2002k:68058)
24. Dániel Marx, Parameterized complexity of constraint satisfaction problems, in: Proceedings of the 19th IEEE Annual Conference on Computational Complexity, CCC'04, 2004, pp. 139-149
25. Monien B., and Preis R. Upper bounds on the bisection width of 3- and 4-regular graphs. J. Discrete Algorithms 4 3 (2006) 475-498 MR2258338
26. Niedermeier R., and Rossmanith P. New upper bounds for maximum satisfiability. J. Algorithms 36 1 (2000) 63-88
27. Schöning U. A probabilistic algorithm for k-SAT and constraint satisfaction problems. 40th Annual Symposium on Foundations of Computer Science, New York, 1999 (1999), IEEE Computer Soc., Los Alamitos, CA 410-414 MR1917579
28. Scott A.D., and Sorkin G.B. Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances. Proc. 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003. Lecture Notes in Comput. Sci. vol. 2764 (August 2003), Springer 382-395
29. 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
30. Alexander D. Scott, Gregory B. Sorkin, Generalized constraint satisfaction problems, Tech. Report cs:DM/0604079v1, arxiv.org, April 2006, See http://arxiv.org/abs/cs.DM/0604079
31. Scott A.D., and Sorkin G.B. An LP-designed algorithm for constraint satisfaction. Proc. 14th Annual European Symposium on Algorithms, ESA, Zürich, Switzerland, 2006. Lecture Notes in Comput. Sci. vol. 4168 (September 2006), Springer 588-599
32. Scott A.D., and Sorkin G.B. Solving sparse random instances of Max Cut and Max 2-CSP in linear expected time. Comb. Probab. Comput. 15 1-2 (2006) 281-315
33. Alexander D. Scott, Gregory B. Sorkin, Polynomial constraint satisfaction: A framework for counting and sampling CSPs and other problems, Tech. Report cs:DM/0604079v2, arxiv.org, February 2007, See http://arxiv.org/abs/cs.DM/0604079
34. Trevisan L., Sorkin G.B., Sudan M., and Williamson D.P. Gadgets, approximation, and linear programming. SIAM J. Comput. 29 6 (2000) 2074-2097
35. Ryan Williams, A new algorithm for optimal constraint satisfaction and its implications, in: Proc. 31st International Colloquium on Automata, Languages and Programming, ICALP, 2004