Approximation Schemes for Orienteering and Deadline Traveling Salesman Problem in Doubling Metrics

This paper presents the first approximation schemes for the deadline Traveling Salesman Problem (TSP) on metrics with bounded doubling dimension, which includes Euclidean metrics of fixed dimension. The authors also provide quasi-polynomial time approximation schemes for the k-stroll and point-to-point (P2P) orienteering problems on such metrics.