The Directed Minimum Latency Problem

We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of latencies at all vertices (the latency of any vertex v V is the distance from r to v along the path). This problem has been well-studied on symmetric metrics, and the best known approximation guarantee is 3.59 [3]. For any 1 log n < < 1, we give an nO(1/ ) time algorithm for directed latency that achieves an approximation ratio of O(

• Type: Conference
• Year: 2008
• Where: APPROX
• Authors: Viswanath Nagarajan, R. Ravi
• Keywords: Algorithms, APPROX 2008, Asymmetric Traveling Salesman, Directed Latency, Latency Problem