MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we present a theoretical framewok of hybrid approaches combining the algorithms of Goemans-Williamson and Yannakakis. This framework leads to a unified analysis of the performance guarantees of proposed algorithms and also leads to a better approximation algorithm with performance guarantee 0.770, if we use a refinement of Yannakakis’ algorithm.
CITATION STYLE
Asano, T., Hori, K., Ono, T., & Hirata, T. (1997). A theoretical framework of hybrid approaches to MAX SAT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1350, pp. 153–162). Springer Verlag. https://doi.org/10.1007/3-540-63890-3_18
Mendeley helps you to discover research relevant for your work.