Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao. Finding a Length-Constrained Maximum-Density Path in a Tree. In Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono, editors, Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings. Volume 2906 of Lecture Notes in Computer Science, pages 78-87, Springer, 2003. [doi]
Abstract is missing.