Bounds on The Performance of a Greedy Algorithm for Probabilities.
John C. GittinsGavin HarperPublished in: Math. Oper. Res. (2001)
Keyphrases
- greedy algorithm
- worst case
- randomized algorithm
- upper bound
- approximation guarantees
- lower bound
- greedy algorithms
- objective function
- dynamic programming
- set cover
- greedy strategy
- lower and upper bounds
- knapsack problem
- average case
- greedy heuristic
- submodular functions
- influence maximization
- np hard
- social networks
- convex optimization
- search algorithm