Exact algorithms for the minimum latency problem

Authors:
Bang Ye Wu;Zheng-Nan Huang;Fu-Jie Zhan
Affiliations:
Department of Computer Science and Information Engineering, Shu-Te University, YenChau, Kaohsiung, Taiwan 824, R.O.C.;Department of Computer Science and Information Engineering, Shu-Te University, YenChau, Kaohsiung, Taiwan 824, R.O.C.;Department of Computer Science and Information Engineering, Shu-Te University, YenChau, Kaohsiung, Taiwan 824, R.O.C.
Venue:
Information Processing Letters
Year:
2004

The delivery man problem on a tree network

Annals of Operations Research
The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time algorithms for some minimum latency problems

Information Processing Letters
Faster approximation algorithms for the minimum latency problem

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Minimum Latency Problem Is NP-Hard for Weighted Trees

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Searching a Fixed Graph

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Approximation Schemes for Minimum Latency Problems

SIAM Journal on Computing
Paths, Trees, and Minimum Latency Tours

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science

Hi-index	0.89