Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm.
Jingwen ChenZhongzheng TangChenhao WangPublished in: AAIM (2022)
Keyphrases
- dynamic programming
- objective function
- greedy algorithm
- experimental evaluation
- k means
- high accuracy
- optimal solution
- greedy heuristic
- significant improvement
- preprocessing
- cost function
- knapsack problem
- optimization algorithm
- times faster
- learning algorithm
- linear programming
- theoretical analysis
- detection algorithm
- locally optimal
- computationally efficient
- data sets
- expectation maximization
- particle swarm optimization
- tree structure
- classification algorithm
- simulated annealing
- computational cost
- convergence rate
- np hard
- packing problem
- data analysis
- neural network