Exact MAX 2-SAT: Easier and faster

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4362 LNCS, Issue , 2007, Pages 272-283

  Fürer, Martin ^a   Kasiviswanathan, Shiva Prasad ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PROBLEM SOLVING;

CONSTRAINT GRAPH; GADGETS;

GRAPH THEORY;

EID: 36448936802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69507-3_22     Document Type: Conference Paper

References (23)

1. Alber, J., Gramm, J., and Niedermeier, R.: Faster Exact Algorithms for Hard Problems: a Parameterized Point of View. Discrete Mathematics 229 1 (2001) 3-27
2. Alon, N., Seymour, P., and Thomas, R.: A Separator Theorem for Graphs with an Excluded Minor and Its Applications, STOC'90, ACM (1990) 293-299
3. 5. Operations Research Letters 2 3 (1983) 107-111
4. Bellare, M., Goldreich, O., and Sudan, M.: Free Bits, PCPs, and Nonapproximability-Towards Tight Results. SIAM Journal of Computing 27 3 (1998) 804-915
5. Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., and Kloks, T.: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. Journal of Algorithms 18 2 (1995) 238-255
6. Dahllöf, V., Jonsson, P., and Wahlström, M.: Counting Models for 2SAT and 3SAT Formulae. Theoretical Computer Science 332 1-3 (2005) 265-291
7. Davis, M., Logemann, G., and Loveland, D.: A Machine Program for Theorem-Proving. Communications of the ACM 5 7 (1962) 394-397
8. Davis, M. and Putnam, H.: A Computing Procedure for Quantification Theory. Journal of Association Computer Machinery 7 (1960) 201-215
9. Fürer, M. and Kasiviswanathan, S.P.: Algorithms for Counting 2-SAT Solutions and Colorings with Applications. Technical report TR05-033, Electronic Colloquium on Computational Complexity (2005)
10. Gilbert, J.R., Hutchinson, J.P., and Tarjan, R.E.: A Separator Theorem for Graphs of Bounded Genus. Journal of Algorithms 5 3 (1984) 391-407
11. 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 Applied Mathematics 130 2 (2003) 139-155
12. Hadlock, F.: Finding a Maximum Cut of a Planar Graph in Polynomial Time. SIAM Journal on Computing 4 3 (1975) 221-225
13. Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., and Stearns, R.E.: The Complexity of Planar Counting Problems. SIAM Journal of Computing 27 4 (1998) 1142-1167
14. Karypis, G. and Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing 20 1 (1998) 359-392
15. Kojevnikov, A. and Kulikov, A.S.: A New Approach to Proving Upper Bounds for MAX-2-SAT. SODA'06, SIAM (2006) 11-17
16. Lipton, R. and Tarjan, R.E.: A Separator Theorem for Planar Graphs. SIAM Journal of Applied Mathematics 36 (1979) 177-189
17. Ravi, S.S. and Hunt, III, H.B.: An Application of the Planar Separator Theorem to Counting Problems. Information Processing Letters 25 5 (1987) 317-321
18. Scott, A.D. and Sorkin, G.B.: Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. RANDOM'03, Springer, 2764 (2003) 382-395
19. Trevisan, L., Sorkin, G.B., Sudan, M., and Williamson, D.P.: Gadgets, Approximation, and Linear Programming. SIAM Journal on Computing 29 6 (2000) 2074-2097
20. Vadhan, S.P.: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal of Computing 31 2 (2002) 398-427
21. Williams, R.: A New Algorithm for Optimal Constraint Satisfaction and Its Implications. ICALP'04, Springer 3142 (2004) 1227-1237
22. Woeginger, G.: Exact Algorithms for NP-Hard Problems: A Survey. Combinatorial Optimization - Eureka! You shrink!, Springer 2570 (2003) 185-207
23. Woeginger, G.: Space and Time Complexity of Exact Algorithms: Some Open Problems. IWPEC'04, Springer 3162 (2004) 281-290