The Directed Minimum Latency Problem.pdf.pdf' (224.22 kB)
The Directed Minimum Latency Problem
journal contribution
posted on 2008-04-01, 00:00 authored by Viswanath Nagarajan, Ramamoorthi RaviRamamoorthi RaviThe 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).