 
Summary: Approximation Schemes for Minimum Latency Problems
Sanjeev Arora #
Princeton University
George Karakostas +
Princeton University
Abstract
The minimum latency problem, also known as traveling
repairman problem [1], is a variant of the TSP 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 quasipolynomialtime approximation
scheme for this problem when the instance is a weighted
tree and when the the nodes lie in # d for some fixed d.
The best polynomial time approximation algorithm due
to Goemans and Kleinberg, computes a 3.59... approxi
mation.
1 Introduction
The minimum latency problem, also known as traveling
repairman problem [1], is a variant of the TSP in which
the starting node of the tour is given and the goal is to
