A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.
T.-H. Hubert ChanHaotian JiangShaofeng H.-C. JiangPublished in: ACM Trans. Algorithms (2020)
Keyphrases
- prize collecting
- traveling salesman problem
- travel time
- approximation algorithms
- genetic algorithm
- travelling salesman
- ant colony optimization
- evaluation metrics
- particle swarm optimization
- combinatorial optimization
- special case
- polynomial time approximation
- np hard
- optimization problems
- search space
- optimal solution
- single machine scheduling problem
- approximation schemes
- neural network