A New Algorithm for MAX-2-SAT

  • Edward A. Hirsch
Conference paper

DOI: 10.1007/3-540-46541-3_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)
Cite this paper as:
Hirsch E.A. (2000) A New Algorithm for MAX-2-SAT. In: Reichel H., Tison S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg

Abstract

Recently there was a significant progress in proving (exponential-time) worst-case upper bounds for the propositional satisfiability problem (SAT) and related problems. In particular, for MAX-2-SAT Niedermeier and Rossmanith recently presented an algorithm with worstcase upper bound O(K ·2K/2.88...), and the bound O(K ·2K/3.44...) is implicit from the paper by Bansal and Raman (K is the number of clauses). In this paper we improve this bound to p(K)2K2/4, where K2 is the number of 2-clauses, and p is a polynomial. In addition, our algorithm and the proof are much simpler than the previous ones. The key ideas are to use the symmetric flow algorithm of Yannakakis and to count only 2-clauses (and not 1-clauses).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Edward A. Hirsch
    • 1
  1. 1.Steklov Institute of Mathematics at St.PetersburgSt.PetersburgRussia

Personalised recommendations