@inproceedings{8d2d6e7222824745bce6715008aa45e4,
title = "Improved approximation algorithms for MAX NAE-SAT and MAX SAT",
abstract = "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].",
author = "Adi Avidor and Ido Berkovitch and Uri Zwick",
year = "2006",
doi = "10.1007/11671411_3",
language = "אנגלית",
isbn = "3540322078",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "27--40",
booktitle = "Approximation and Online Algorithms - Third International Workshop, WAOA 2005, Revised Selected Papers",
note = "null ; Conference date: 06-10-2005 Through 07-10-2005",
}