On the generality of the greedy algorithm for solving matroid base problems.

Lara Turner Matthias Ehrgott Horst W. Hamacher

Published in: Discret. Appl. Math. (2015)

Keyphrases

greedy algorithm
greedy algorithms
submodular functions
objective function
greedy strategy
combinatorial optimization
set cover
special case
dynamic programming
worst case
knapsack problem
optimization problems
convex optimization
greedy heuristic
influence spread