Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT [chapter]

Adi Avidor, Ido Berkovitch, Uri Zwick
2006 Lecture Notes in Computer Science  
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
more » ... n 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].
doi:10.1007/11671411_3 fatcat:6lts5txgsff4pahfcf7yac2s6m