Approximating MAX SAT by moderately exponential algorithms

Bruno Escoffier (1) , Vangelis Paschos (1) , Emeric Tourniaire (1)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

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.

Domaines: Algorithme et structure de données [cs.DS]; Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Bruno Escoffier, Vangelis Paschos, Emeric Tourniaire. Approximating MAX SAT by moderately exponential algorithms. 2011. ⟨hal-00875648⟩