Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time.
Alan KuhnlePublished in: NeurIPS (2019)
Keyphrases
- submodular functions
- greedy algorithm
- worst case
- objective function
- greedy algorithms
- set cover
- dynamic programming
- upper bound
- greedy strategy
- greedy heuristic
- randomized algorithm
- lower bound
- knapsack problem
- approximation algorithms
- influence spread
- influence maximization
- learning algorithm
- pairwise
- optimal solution
- optimization problems
- cost function