Pré-Publication, Document De Travail Année : 2011

Approximating MAX SAT by moderately exponential algorithms

Résumé

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
cahier_304.pdf (254.58 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00875648 , version 1 (22-10-2013)

Licence

Identifiants

  • HAL Id : hal-00875648 , version 1

Citer

Bruno Escoffier, Vangelis Paschos, Emeric Tourniaire. Approximating MAX SAT by moderately exponential algorithms. 2011. ⟨hal-00875648⟩
173 Consultations
200 Téléchargements

Partager

  • More