Login / Signup
Efficient approximation of min set cover by moderately exponential algorithms.
Nicolas Bourgeois
Bruno Escoffier
Vangelis Th. Paschos
Published in:
Theor. Comput. Sci. (2009)
Keyphrases
</>
set cover
approximation algorithms
computationally efficient
np hard
greedy algorithm
greedy heuristics
greedy heuristic
learning algorithm
data structure
worst case
special case
data mining techniques
np complete
error bounds