On the generality of the greedy algorithm for solving matroid problems.
Lara TurnerMatthias EhrgottHorst W. HamacherPublished in: CTW (2013)
Keyphrases
- greedy algorithm
- greedy algorithms
- worst case
- submodular functions
- objective function
- dynamic programming
- combinatorial optimization
- influence spread
- set cover
- randomized algorithm
- knapsack problem
- convex optimization problems
- influence maximization
- greedy heuristic
- approximation ratio
- permutation flowshop
- optimization problems