The Directed Minimum Latency Problem

Abstract

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… (More)
DOI: 10.1007/978-3-540-85363-3_16

Topics

1 Figure or Table

Cite this paper

@inproceedings{Nagarajan2008TheDM, title={The Directed Minimum Latency Problem}, author={Viswanath Nagarajan and R. Ravi}, booktitle={APPROX-RANDOM}, year={2008} }