Communication Dans Un Congrès Année : 2012

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 onpolynomial inapproximability, by providing algorithms achieving, with worst-case runningtimes importantly smaller than those needed for exact computation, approximation ratiosunachievable in polynomial time. We develop several approximation techniques that can beapplied to max sat in order to get approximation ratios arbitrarily close to 1.

Fichier principal
Vignette du fichier
cahier304.PDF (254.58 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-01509537 , version 1 (18-04-2017)

Licence

Identifiants

Citer

Bruno Escoffier, Vangelis Paschos, Emeric Tourniaire. Approximating MAX SAT by moderately exponential algorithms. 9th Annual Conference on Theory and Applications of Models of Computation TAMC 2012, May 2012, Beijing, China. pp.622, ⟨10.1007/978-3-642-29952-0_23⟩. ⟨hal-01509537⟩
77 Consultations
111 Téléchargements

Altmetric

Partager

  • More