Reload cost problems: minimum diameter spanning tree

Chang, 1997, The minimum labeling spanning trees, Inform. Process. Lett., 63, 277, 10.1016/S0020-0190(97)00127-0 U. Feige, A threshold of ln n for approximating set cover, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC’96), 1996, pp. 314–318. M.R. Garey, D.S. Johnson, Computers and Intractability (A guide to the theory of NP-completeness), W.H. Freeman, New York, 1979. Hassin, 1995, On the minimum diameter spanning tree problem, Inform. Process. Lett., 53, 109, 10.1016/0020-0190(94)00183-Y Kariv, 1979, An algorithmic approach to network location problems, part I: The p-center, SIAM J. Appl. Math., 37, 513, 10.1137/0137040 Krumke, 1998, On the minimum label spanning tree problem, Inform. Process. Lett., 66, 81, 10.1016/S0020-0190(98)00034-9 Plesnı́k, 1981, The complexity of designing a network with minimum diameter, Networks, 11, 77, 10.1002/net.3230110110 H.-C. Wirth, J. Steffan, On minimum diameter spanning trees under reload costs, in: Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’99), Lecture Notes in Computer Science, Vol. 1665, eds. P. Widmayer, G. Neyer, S. Eidenbenz, Springer, Berlin, 1999, pp. 78–88.