The Minimum Latency Problem Is NP-Hard for Weighted Trees

Abstract

In the minimum latency problem (MLP) we are given n points v1, . . . , vn and a distance d(vi, vj) between any pair of points. We have to find a tour, starting at v1 and visiting all points, for which the sum of arrival times is minimal. The arrival time at a point vi is the traveled distance from v1 to vi in the tour. The minimum latency problem is MAX-SNP… (More)
DOI: 10.1007/3-540-47867-1_17

Topics

1 Figure or Table

Cite this paper

@inproceedings{Sitters2002TheML, title={The Minimum Latency Problem Is NP-Hard for Weighted Trees}, author={Ren{\'e} Sitters}, booktitle={IPCO}, year={2002} }