The minimum-entropy set cover problem.

Eran Halperin Richard M. Karp

Published in: Theor. Comput. Sci. (2005)

Keyphrases

set cover
greedy algorithm
approximation algorithms
network flow
greedy heuristics
np hard
solution space
convex hull
primal dual
greedy heuristic
special case
learning algorithm
knapsack problem
convex optimization