Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2014

Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms

Abstract

We study approximation of the max sat problem by moderately exponential algorithms. The general goal of the issue of moderately exponential approximation is to catch-up on polynomial inapproximability, by providing algorithms achieving, with worst-case running times importantly smaller than those needed for exact computation, approximation ratios unachievable in polynomial time. We develop several approximation techniques that can be applied to max sat in order to get approximation ratios arbitrarily close to 1.
Fichier principal
Vignette du fichier
effapproxoptsat3.pdf (250.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01099861 , version 1 (05-01-2015)

Identifiers

Cite

Bruno Escoffier, Vangelis Paschos, Emeric Tourniaire. Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. Theoretical Computer Science, 2014, 560 (2), pp.147-157. ⟨10.1016/j.tcs.2014.10.039⟩. ⟨hal-01099861⟩
92 View
304 Download

Altmetric

Share

Gmail Facebook X LinkedIn More