On the minimum diameter spanning tree problem

Cunninghame-Greene, 1984, The absolute center of a graph, Discrete Appl. Math., 7, 275, 10.1016/0166-218X(84)90004-0 Fredman, 1987, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34, 1004, 10.1145/28869.28874 Hakimi, 1964, Optimal locations of switching centers and medians of a graph, Oper. Res., 12, 450, 10.1287/opre.12.3.450 Handler, 1973, Minimax location of a facility in an undirected tree graph, Transportation Sci., 7, 287, 10.1287/trsc.7.3.287 Ho, 1991, Minimum diameter spanning trees and related problems, SIAM J. Comput., 20, 987, 10.1137/0220060 Hakimi, 1978, On p-centers in networks, Transportation Sci., 12, 1, 10.1287/trsc.12.1.1 Ihler, 1991, On shortest networks for classes of points in the plane, 551, 103 Kariv, 1979, An algorithmic approach to network location problems I: The p-centers, SIAM J. Appl. Math., 37, 513, 10.1137/0137040 Minieka, 1977, The centers and medians of a graph, Oper. Res., 25, 641, 10.1287/opre.25.4.641 Tamir, 1988, Improved complexity bounds for center location problems on networks by using dynamic data structures, SIAM J. Discrete Math., 1, 377, 10.1137/0401038