Greedy Differential Approximations for Min Set Cover.

Cristina Bazgan Jérôme Monnot Vangelis Th. Paschos Fabrice Serrière

Published in: SOFSEM (2005)

Keyphrases

set cover
greedy algorithm
greedy heuristic
greedy heuristics
np hard
approximation algorithms
dynamic programming
objective function
worst case
knapsack problem
special case
network flow
data structure
feature extraction
convex hull
solution space
denoising