Title :
Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson
Author_Institution :
Dept. of Inf. & Syst. Eng., Chuo Univ., Tokyo, Japan
Abstract :
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 consider approximation algorithms for MAX SAT proposed by Yannnkakis and Goemans-Williamson and present an approximation algorithm which is an improvement of Yannakakis´ algorithm. Although Yannakakis´ original algorithm has no better performance guarantee than Goemans-Williamson, our improved algorithm has a better performance guarantee and leads to a 0.770 approximation algorithm
Keywords :
approximation theory; computability; computational complexity; MAX SAT; approximation algorithms; clauses; maximum satisfiability problem; truth assignment; weights; Approximation algorithms; Educational programs; Polynomials; Programming profession; Systems engineering and theory;
Conference_Titel :
Theory of Computing and Systems, 1997., Proceedings of the Fifth Israeli Symposium on
Conference_Location :
Ramat-Gan
Print_ISBN :
0-8186-8037-7
DOI :
10.1109/ISTCS.1997.595154
