An efficient algorithm for the length-constrained heaviest path problem on a tree

Information Processing Letters

Volumn 69, Issue 2, 1999, Pages 63-67

  Wu, Bang Ye ^a   Chao, Kun Mao ^b   Tang, Chuan Yi ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b PROVIDENCE UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Divide and conquer; Network design; Trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING;

LENGTH-CONSTRAINED HEAVIEST PATH PROBLEMS;

TREES (MATHEMATICS);

EID: 0032732481     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00194-x     Document Type: Article

References (6)

1. T.H. Coremen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1994.
2. A.J. Goldman, Optimal center location in simple networks, Transportation Sci. 5 (1971) 212-221.
3. O. Kariv, S.L. Hakimi, An algorithmic approach to network location problems. I: The p-centers, SIAM J. Appl. Math. 37 (1979) 513-538.
4. 2 n) algorithm for the kth longest path in a tree with applications to location problems, SIAM J. Comput. 10 (2) (1981) 328-337.
5. S. Peng, W.-T. Lo, Efficient algorithms for finding a core of a tree with a specified length, J. Algorithms 20 (1996) 445-458.
6. B.Y. Wu, C.Y. Tang, An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree, Inform. Process. Lett. 63 (1997) 263-269.