Exact algorithms for the minimum latency problem
Information Processing Letters
The orienteering problem in the plane revisited
Proceedings of the twenty-second annual symposium on Computational geometry
Exact algorithms for the minimum latency problem
Information Processing Letters
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Branch and bound algorithm for a single vehicle routing problem with toll-by-weight scheme
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
The role of centrality in ambulance dispatching
Decision Support Systems
| Hi-index | 0.00 |
The minimum latency problem, also known as the traveling repairman problem, is a variant of the traveling salesman problem in which the starting node of the tour is given and the goal is to minimize the sum of the arrival times at the other nodes. We present a quasi-polynomial time approximation scheme (QPTAS) for this problem when the instance is a weighted tree, when the nodes lie in $\mathbb{R}^d$ for some fixed d, and for planar graphs. We also present a polynomial time constant factor approximation algorithm for the general metric case. The currently best polynomial time approximation algorithm for general metrics, due to Goemans and Kleinberg, computes a 3.59-approximation.