In the minimum latency problem (MLP) we are given n points v_1, …, v_n and a distance d(v_i, v_j) between any pair of points. We have to find a tour, starting at v_1 and visiting all points, for which the sum of arrival times is minimal. The arrival time at a point v_i is the traveled distance from v_1 to v_i in the tour. The minimum latency problem is MAX-SNP-hard for general metric spaces, but the complexity for the problem where the metric is given by an edge-weighted tree has been a long-standing open problem. We show that the minimum latency problem is NP-hard for trees even with weights in {0, 1}.
展开▼
