Asymptotic packing and the random greedy algorithm.
Vojtech RödlLubos ThomaPublished in: Random Struct. Algorithms (1996)
Keyphrases
- greedy algorithm
- worst case
- greedy algorithms
- greedy strategy
- objective function
- greedy heuristic
- influence maximization
- set cover
- upper bound
- knapsack problem
- lower bound
- influence spread
- reinforcement learning
- submodular functions
- approximation guarantees
- packing problem
- approximation algorithms
- model selection
- search algorithm