Approximating MAX SAT by moderately exponential and parameterized algorithms.

Bruno Escoffier Vangelis Th. Paschos Emeric Tourniaire

Published in: Theor. Comput. Sci. (2014)

Keyphrases

max sat
data structure
learning algorithm
stochastic local search
upper bound
tabu search
practical problems
exact algorithms
computational complexity
test collection
branch and bound algorithm
randomly generated
strongly connected components