The minimum latency problem is NP-hard for weighted trees

R.A. Sitters

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

66 Citations (Scopus)


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}.
Original languageEnglish
Title of host publicationInteger Programming and Combinatorial Optimization (Proceedings 9th IPCO, Cambridge MA, USA, May 27-29, 2002)
EditorsW.J. Cook, A.S. Schulz
Place of PublicationBerlin
ISBN (Print)3-540-43676-6
Publication statusPublished - 2002

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'The minimum latency problem is NP-hard for weighted trees'. Together they form a unique fingerprint.

Cite this