An O(n log n) algorithm for the kth longest path in a tree with applications to location problems (1981)

by N Megiddo, A Tamir, E Zemel, R Chandrasekaran
Venue:SIAM Journal on Computing