A Dynamic Algorithm for Submodular Maximization with a Knapsack Constraint.
Tianshuai ZhuKai HanEnpei ZhangBenwei WuPublished in: HPCC/DSS/SmartCity/DependSys (2021)
Keyphrases
- objective function
- dynamic programming
- detection algorithm
- knapsack problem
- computational complexity
- search space
- experimental evaluation
- improved algorithm
- high accuracy
- worst case
- similarity measure
- times faster
- segmentation algorithm
- learning algorithm
- computational cost
- optimal solution
- path planning
- classification algorithm
- cost function
- dynamic environments
- expectation maximization
- particle swarm optimization
- linear programming
- upper bound
- optimization algorithm
- significant improvement
- shortest path
- energy function
- tree structure
- matching algorithm
- k means
- np hard