The Minimum Entropy Submodular Set Cover Problem.

Gabriel Istrate Cosmin Bonchis Liviu P. Dinu

Published in: LATA (2016)

Keyphrases

set cover
greedy algorithm
greedy heuristics
worst case
approximation algorithms
greedy heuristic
objective function
np hard
solution space
network flow
submodular functions
data sets
dynamic programming