Highly Influenced

@article{Wu2004ExactAF, title={Exact algorithms for the minimum latency problem}, author={Bang Ye Wu and Zheng-Nan Huang and Fu-Jie Zhan}, journal={Inf. Process. Lett.}, year={2004}, volume={92}, pages={303-309} }

- Published 2004 in Inf. Process. Lett.
DOI:10.1016/j.ipl.2004.09.009

Let G = (V, E,w) be an undirected graph with positive weight w(e) on each edge e ∈ E. Given a starting vertex s ∈ V and a subset U ⊂ V as the demand vertex set, the minimum latency problem (MLP) asks for a tour P starting at s and visiting each demand vertex at least once such that the total latency of all demand vertices is minimized, in which the latency of a vertex is the length of the path from s to the first visit of the vertex. The MLP is an important problem in computer science and… CONTINUE READING

Highly Cited

This paper has 41 citations. REVIEW CITATIONS