Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint.
Jing TangXueyan TangAndrew LimKai HanChongshou LiJunsong YuanPublished in: Proc. ACM Meas. Anal. Comput. Syst. (2021)
Keyphrases
- greedy algorithm
- submodular functions
- knapsack problem
- dynamic programming
- objective function
- greedy heuristic
- upper bound
- greedy algorithms
- worst case
- greedy strategy
- set cover
- anti monotone
- influence maximization
- optimal solution
- feasible solution
- fully automated
- social network analysis
- markov random field
- squeaky wheel