Multiparameterizations for max $k$-set cover and related satisfiability problems.

Edouard Bonnet Vangelis Th. Paschos Florian Sikora

Published in: CoRR (2013)

Keyphrases

satisfiability problem
set cover
greedy algorithm
approximation algorithms
np complete
phase transition
greedy heuristics
search algorithm
temporal logic
network flow
sat problem
stochastic local search
np hard
davis putnam
pspace complete
finite domain
solving hard
upper bound
greedy heuristic
knowledge base