A 5-approximation algorithm for the k-prize-collecting Steiner tree problem.
Lu HanDachuan XuDonglei DuChenchen WuPublished in: Optim. Lett. (2019)
Keyphrases
- prize collecting
- detection algorithm
- approximation ratio
- learning algorithm
- cost function
- optimal solution
- computational complexity
- search strategy
- search space
- dynamic programming
- worst case
- linear programming
- special case
- optimization algorithm
- combinatorial optimization
- convergence rate
- standard deviation
- benchmark problems
- solution quality
- objective function
- neural network