Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT

MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.8279. This improves a previously conjectured performance guarantee of 0.7977 of Zwick [Zwi99]. Using a variant of our MAX NAE-SAT approximation algorithm, combined with other techniques used in [Asa03], we obtain an approximation algorithm for MAX SAT with a conjectured performance guarantee of 0.8434. This improves on an approximation algorithm of Asano [Asa03] with a conjectured performance guarantee of 0.8353. We also obtain a 0.7968-approximation algorithm for MAX SAT which is not based on any conjecture, improving a 0.7877-approximation algorithm of Asano [Asa03].

• Type: Conference
• Year: 2005
• Where: WAOA
• Authors: Adi Avidor, Ido Berkovitch, Uri Zwick
• Keywords: Approximation Algorithm, Conjectured Performance Guarantee, MAX NAE-SAT, WAOA 2005