On the minimum diameter spanning tree problem
- 1 January 1995
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 53 (2) , 109-111
- https://doi.org/10.1016/0020-0190(94)00183-y
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Minimum Diameter Spanning Trees and Related ProblemsSIAM Journal on Computing, 1991
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data StructuresSIAM Journal on Discrete Mathematics, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- The absolute centre of a graphDiscrete Applied Mathematics, 1984
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- On p-Centers in NetworksTransportation Science, 1978
- The Centers and Medians of a GraphOperations Research, 1977
- Minimax Location of a Facility in an Undirected Tree GraphTransportation Science, 1973
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a GraphOperations Research, 1964