The Directed Minimum Latency Problem.pdf.pdf' (224.22 kB)

The Directed Minimum Latency Problem

Download (224.22 kB)
journal contribution
posted on 01.04.2008 by Viswanath Nagarajan, Ramamoorthi Ravi
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).

History

Date

01/04/2008

Exports

Exports