2002 | OriginalPaper | Buchkapitel
The Minimum Latency Problem Is NP-Hard for Weighted Trees
verfasst von : René Sitters
Erschienen in: Integer Programming and Combinatorial Optimization
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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-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}.