论文信息 - On the Minimum Diameter Spanning Tree Problem - 字舞流文

On the Minimum Diameter Spanning Tree Problem

We point out a relation between the minimum diameter spanning tree of a graph and its absolute 1-center. We use this relation to solve the diameter problem and an extension of it efficiently.

Refael Hassin | Arie Tamir | Refael Hassin | A. Tamir

[1] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[2] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[3] S. Hakimi,et al. On p -Centers in Networks , 1978 .

[4] Arie Tamir,et al. Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures , 1988, SIAM J. Discret. Math..

[5] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[6] Edmund Ihler,et al. On Shortest Networks for Classes of Points in the Plane , 1991, Workshop on Computational Geometry.

[7] G. Handler. Minimax Location of a Facility in an Undirected Tree Graph , 1973 .

[8] Edward Minieka,et al. The Centers and Medians of a Graph , 1977, Oper. Res..

[9] Chak-Kuen Wong,et al. Minimum Diameter Spanning Trees and Related Problems , 1991, SIAM J. Comput..

[10] Yuri Gurevich,et al. Monotone versus positive , 1987, JACM.

[11] Raymond A. Cuninghame-Green,et al. The absolute centre of a graph , 1984, Discret. Appl. Math..