Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint.
Zhenning ZhangBin LiuYishui WangDachuan XuDongmei ZhangPublished in: COCOON (2019)
Keyphrases
- greedy algorithm
- submodular functions
- knapsack problem
- objective function
- dynamic programming
- greedy heuristic
- greedy algorithms
- worst case
- influence maximization
- set cover
- feasible solution
- influence spread
- upper bound
- supervised learning
- facility location problem
- randomized algorithm
- evolutionary algorithm
- image processing
- learning algorithm