An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties.
Jiaxuan ZhangSuogang GaoBo HouWen LiuPublished in: Comput. Appl. Math. (2022)
Keyphrases
- prize collecting
- objective function
- learning algorithm
- search space
- computational complexity
- k means
- np hard
- approximation ratio
- greedy algorithm
- error bounds
- cost function
- dynamic programming
- genetic algorithm
- optimal solution
- branch and bound algorithm
- convergence rate
- combinatorial optimization
- optimization algorithm
- expectation maximization
- response time
- special case