The Minimum Latency Problem Is NP-Hard for Weighted Trees

@inproceedings{Sitters2002TheML,
  title={The Minimum Latency Problem Is NP-Hard for Weighted Trees},
  author={Ren{\'e} Sitters},
  booktitle={IPCO},
  year={2002}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

The delivery man problem on a tree network

E. Minieka
Annals of Operations Research • 1989
View 4 Excerpts
Highly Influenced

A note on the travelling repairman problem, Pre-publications del seminario mathematico

A. Garćıa, P. Jodrá, J. Tejel
2001

Similar Papers

Loading similar papers…