-set cover and related satisfiability problems.

Édouard Bonnet Vangelis Th. Paschos Florian Sikora

Published in: RAIRO Theor. Informatics Appl. (2016)

Keyphrases

satisfiability problem
set cover
approximation algorithms
np complete
greedy algorithm
search algorithm
phase transition
temporal logic
sat problem
greedy heuristics
orders of magnitude
network flow
special case
np hard
solving hard