A 4-approximation algorithm for k-prize collecting Steiner tree problems.
Yusa MatsudaSatoshi TakahashiPublished in: Optim. Lett. (2019)
Keyphrases
- steiner tree
- optimal solution
- benchmark problems
- cost function
- np hard
- dynamic programming
- prize collecting
- particle swarm optimization
- ant colony optimization
- search space
- simulated annealing
- segmentation algorithm
- minimum spanning tree
- computational complexity
- genetic algorithm
- scheduling problem
- optimization problems