Approximating MIN κ-SAT

Adi Avidor, Uri Zwick

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

10 Scopus citations

Abstract

We obtain substantially improved approximation algorithms for the MIN k-SAT problem, for k = 2, 3. More specifically, we obtain a 1.1037-approximation algorithm for the MIN 2-SAT problem, improving a previous 1.5-approximation algorithm, and a 1.2136-approximation algorithm for the MIN 3-SAT problem, improving a previous 1.75-approximation algorithm for the problem. These results are obtained by adapting techniques that were previously used to obtain approximation algorithms for the MAX k-SAT problem. We also obtain some hardness of approximation results.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings
Pages465-475
Number of pages11
DOIs
StatePublished - 2002
Event13th Annual International Symposium on Algorithms and Computation, ISAAC 2002 - Vancouver, BC, Canada
Duration: 21 Nov 200223 Nov 2002

Publication series

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

Conference

Conference13th Annual International Symposium on Algorithms and Computation, ISAAC 2002
Country/TerritoryCanada
CityVancouver, BC
Period21/11/0223/11/02

Fingerprint

Dive into the research topics of 'Approximating MIN κ-SAT'. Together they form a unique fingerprint.

Cite this