TY - JOUR

T1 - MAX SAT approximation beyond the limits of polynomial-time approximation

AU - Dantsin, Evgeny

AU - Gavrilovich, Michael

AU - Hirsch, Edward A.

AU - Konev, Boris

PY - 2001/12/27

Y1 - 2001/12/27

N2 - We describe approximation algorithms for (unweighted) MAX SAT with performance ratios arbitrarily close to 1, in particular, when performance ratios exceed the limits of polynomial-time approximation. Namely, given a polynomial-time α-approximation algorithm A0, we construct an (α+ε)-approximation algorithm A. The algorithm A runs in time of the order cεk, where k is the number of clauses in the input formula and c is a constant depending on α. Thus we estimate the cost of improving a performance ratio. Similar constructions for MAX 2SAT and MAX 3SAT are also described. Taking known algorithms as A0 (for example, the Karloff-Zwick algorithm for MAX 3SAT), we obtain particular upper bounds on the running time of A.

AB - We describe approximation algorithms for (unweighted) MAX SAT with performance ratios arbitrarily close to 1, in particular, when performance ratios exceed the limits of polynomial-time approximation. Namely, given a polynomial-time α-approximation algorithm A0, we construct an (α+ε)-approximation algorithm A. The algorithm A runs in time of the order cεk, where k is the number of clauses in the input formula and c is a constant depending on α. Thus we estimate the cost of improving a performance ratio. Similar constructions for MAX 2SAT and MAX 3SAT are also described. Taking known algorithms as A0 (for example, the Karloff-Zwick algorithm for MAX 3SAT), we obtain particular upper bounds on the running time of A.

KW - 03B05

KW - 03B25

KW - 68W25

KW - Approximation algorithms

KW - Maximum satisfiability problem

UR - http://www.scopus.com/inward/record.url?scp=0035960967&partnerID=8YFLogxK

U2 - 10.1016/S0168-0072(01)00052-5

DO - 10.1016/S0168-0072(01)00052-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0035960967

SN - 0168-0072

VL - 113

SP - 81

EP - 94

JO - Annals of Pure and Applied Logic

JF - Annals of Pure and Applied Logic

IS - 1-3

ER -