Improved approximation algorithms for MAX NAE-SAT and MAX SAT

Adi Avidor, Ido Berkovitch, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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].

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - Third International Workshop, WAOA 2005, Revised Selected Papers
Pages27-40
Number of pages14
DOIs
StatePublished - 2006
Event3rd International Workshop on Approximation and Online Algorithms, WAOA 2005 - Palma de Mallorca, Spain
Duration: 6 Oct 20057 Oct 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3879 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Workshop on Approximation and Online Algorithms, WAOA 2005
Country/TerritorySpain
CityPalma de Mallorca
Period6/10/057/10/05

Fingerprint

Dive into the research topics of 'Improved approximation algorithms for MAX NAE-SAT and MAX SAT'. Together they form a unique fingerprint.

Cite this