论文信息 - An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree

An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree

Abstract Given a tree with weight and length on each edge, this paper presents an efficient algorithm for locating the length-constrained heaviest path on the tree. The time complexity of the algorithm is O(n log2 n) and can be reduced to O(n log n) if the edge lengths are all integers in the range 1 to O(n), where n is the number of vertices. It is also shown that several similar problems can be solved by the same algorithm.

[1] Shietung Peng,et al. Efficient Algorithms for Finding a Core of a Tree with a Specified Length , 1996, J. Algorithms.

[2] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[3] A. J. Goldman. Optimal Center Location in Simple Networks , 1971 .

[4] Chuan Yi Tang,et al. An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree , 1997, Inf. Process. Lett..

[5] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[6] Nimrod Megiddo,et al. An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..