An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems

Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran. An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM Journal on Computing, 10(2):328-337, 1981.

Abstract

Abstract is missing.