A greedy algorithm for solving a certain class of linear programmes.

F. D. J. Dunstan D. J. A. Welsh

Published in: Math. Program. (1973)

Keyphrases

greedy algorithm
greedy algorithms
submodular functions
dynamic programming
worst case
greedy heuristic
greedy strategy
objective function
set cover
influence spread
convex optimization problems
text mining
optimization problems
knapsack problem
approximation guarantees