An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization.
Zhongzheng TangJingwen ChenChenhao WangPublished in: IJTCS-FAW (2023)
Keyphrases
- dynamic programming
- objective function
- preprocessing
- optimization algorithm
- theoretical analysis
- learning algorithm
- knapsack problem
- computational complexity
- greedy heuristic
- detection algorithm
- search space
- significant improvement
- np hard
- experimental evaluation
- worst case
- greedy algorithm
- high order
- times faster
- improved algorithm
- computational cost
- cost function
- optimal solution
- recognition algorithm
- globally optimal
- approximation algorithms
- locally optimal
- data sets
- greedy algorithms
- tree structure
- clustering method
- particle swarm optimization
- probabilistic model
- association rules
- data analysis
- search algorithm
- neural network