Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint.
Jing TangXueyan TangAndrew LimKai HanChongshou LiJunsong YuanPublished in: CoRR (2020)
Keyphrases
- greedy algorithm
- knapsack problem
- submodular functions
- dynamic programming
- objective function
- greedy heuristic
- upper bound
- worst case
- greedy algorithms
- greedy strategy
- lower bound
- optimal solution
- set cover
- randomized algorithm
- influence maximization
- influence spread
- machine learning
- anti monotone
- feasible solution
- search algorithm