Approximating the dense set-cover problem.

Reuven Bar-Yehuda Zehavit Kehat

Published in: J. Comput. Syst. Sci. (2004)

Keyphrases

set cover
greedy algorithm
approximation algorithms
greedy heuristics
np hard
network flow
solution space
convex hull
greedy heuristic
special case
simulated annealing
neural network
search algorithm
multi objective
dynamic programming
constraint satisfaction problems