A new upper bound for Max-2-Sat: A graph-theoretic approach

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

Volumn 5162 LNCS, Issue , 2008, Pages 551-562

  Raible, Daniel ^a   Fernau, Henning ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; FOUNDATIONS; HEURISTIC METHODS;

BOOLEAN FORMULAS; HEURISTIC; LITERALS; MAX-SAT; RUN TIMES; UPPER BOUNDS; YIELDING;

BOOLEAN FUNCTIONS;

EID: 54249114955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85238-4_45     Document Type: Conference Paper

References (10)

1. Grarnm, J., Hirsch, E.A., Niedermeier, R., Rossmanith, P.: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics 130, 139-155 (2003)
2. Gramm, J., Niedermeier, R.: Faster exact solutions for MAX2SAT. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 174-186. Springer, Heidelberg (2000)
3. Hofmeister, T.: An approximation algorithm for MAX-2-SAT with cardinality constraint. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 301-312. Springer, Heidelberg (2003)
4. Kneis, J., Mö11e, D., Richter, S., Rossmanith, P.: Algorithms based on the treewidth of sparse graphs. In: Kratsch, D. (ed.) WG 2005. LNGS, vol. 3787, pp. 385-396. Springer, Heidelberg (2005)
5. Kojevnikov, A., Kulikov, A.S.: A new approach to proving upper bounds for MAX-2-SAT. In: SODA, pp. 11-17. ACM Press, New York (2006)
6. Kulikov, A.S., Kutzkov, K.: New bounds for max-sat by clause learning. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol. 4649, pp. 194-204. Springer, Heidelberg (2007)
7. Lewin, M., Livnat, D., Zwick, U.: Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 67-82. Springer, Heidelberg (2002)
8. Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. Journal of Algorithms 36, 63-88 (2000)
9. Scott, A., Sorkin, G.: Linear-programming design and analysis of fast algorithms for Max 2-CSP. Discrete Optimization 4(3-4), 260-287 (2007)
10. Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science 348(2-3), 357-365 (2005)