Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms
From MaRDI portal
Publication:2898031
DOI10.1007/978-3-642-29952-0_23zbMath1354.68298OpenAlexW2147656706MaRDI QIDQ2898031
Vangelis Th. Paschos, Emeric Tourniaire, Bruno Escoffier
Publication date: 16 July 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/20957
Related Items (2)
Super-polynomial approximation branching algorithms ⋮ On subexponential and FPT-time inapproximability
This page was built for publication: Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms
