Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree
- 93 Downloads
Given a set P of points in the plane, a geometric minimum-diameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. For several years, the best upper bound on the time to compute a GMDST was cubic with respect to the number of points in the input set. Recently, Timothy Chan introduced a subcubic time algorithm. In this paper we present an algorithm that generates a tree whose diameter is no more than (1 + ε) times that of a GMDST, for any ε > 0. Our algorithm reduces the problem to several grid-aligned versions of the problem and runs within time $O(ε-3+ n) and space O(n).
Unable to display preview. Download preview PDF.
- 3.T. Chan, Semi-online maintenance of geometric optima and measures, Proceedings of the 13th ACM–SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 474–483. Google Scholar
- 5.D. Eppstein, Spanning trees and spanners, in Handbook of Computational Geometry (J.R. Sack and J. Urrutia, eds.), North-Holland, Amsterdam, 2000, pp. 425–462. Google Scholar
- 6.J. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wolff, Facility location and the geometric minimum-diameter spanning tree, in Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), 2002, pp. 146–160. Google Scholar
- 9.W. D. Jones, Euclidean Communication Spanning Trees, M.Sc. Thesis, University of Saskatchewan, 1994. Google Scholar