Sciweavers

APPROX
2008
Springer
135views Algorithms» more  APPROX 2008»
14 years 1 months ago
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...
Viswanath Nagarajan, R. Ravi