An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem.

Matthias Poloczek David P. Williamson

Published in: SEA (2016)

Keyphrases

approximation algorithms
experimental evaluation
special case
np hard
vertex cover
network design problem
worst case
minimum cost
facility location problem
primal dual
precedence constraints
exact algorithms
np hardness
open shop
set cover
approximation guarantees
undirected graph
disjoint paths
learning algorithm