Date of Original Version

8-2008

Type

Conference Proceeding

Abstract or Description

The minimum latency problem [17, 6, 14, 2] is a variant of the basic traveling salesman problem, where there is a metric with a specified root vertex r, and the goal is to find a spanning path starting from r that minimizes the sum of arrival times at all vertices (it is also known as the deliveryman problem or traveling repairman problem).

DOI

10.1007/978-3-540-85363-3_16

Share

COinS
 

Published In

A. Goel et al. (Eds.): APPROX and RANDOM 2008, LNCS 5171, 193-206.