Login / Signup
An Approximation Algorithm for the Minimum Latency Set Cover Problem.
Refael Hassin
Asaf Levin
Published in:
ESA (2005)
Keyphrases
</>
set cover
dynamic programming
approximation algorithms
cost function
learning algorithm
np hard
search space
k means
optimization algorithm
worst case
convex hull
objective function
scheduling problem
greedy algorithm