A New 3 4 -approximation Algorithm for Max Sat

Recently, Yannakakis 5] presented the rst 3 4-approximation algorithm for the Maximum Satiss-ability Problem (MAX SAT). His algorithm makes non-trivial use of solutions to max-ow problems. We present a new 3 4-approximation algorithm that depends solely on the solution to a linear programming relaxation of MAX SAT. The algorithm uses the probabilistic method/randomized rounding in an unusual way. As a by-product, we obtain a tight worst-case analysis of the corresponding duality gap.