Algorithmica

, Volume 38, Issue 4, pp 577–589 | Cite as

Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree

Article

Abstract

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).

Minimum diameter spanning tree Approximation algorithm Geometric graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Callahan, P., Kosaraju, R. 1995A decomposition of multidimensional point sets with applications to k-nearest neighbors and n-body potential fieldsJournal of the ACM426790MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Camerini, P.M., Galbiati, G., Maffioli, F. 1980Complexity of spanning tree problems, IEuropean Journal of Operational Research5346352MATHCrossRefMathSciNetGoogle Scholar
  3. 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
  4. 4.
    Cong, J., He, L., Koh, C., Madden, P. 1996Performance optimization of VLSI interconnection layoutIntegration: the VLSI Journal21194MATHCrossRefGoogle Scholar
  5. 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. 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
  7. 7.
    Hassin, R., Tamir, A. 1995On the minimum diameter spanning tree problemInformation Processing Letters53109111MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Ho, J., Lee, D., Chang, C., Wong, C. 1991Minimum diameter spanning trees and related problemsSIAM Journal on Computing20987997MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    W. D. Jones, Euclidean Communication Spanning Trees, M.Sc. Thesis, University of Saskatchewan, 1994. Google Scholar
  10. 10.
    Kariv, O., Hakimi, S. L. 1979An algorithmic approach to network location problems, I: the p-centersSIAM Journal on Applied Mathematics37513537MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 2003

Authors and Affiliations

  1. 1.School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, N2L 3G1Canada
  2. 2.Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, S7N 5A9Canada
  3. 3.Department of Computer Science, Duke University, Box 90129, Durham, NC 27708USA
  4. 4.Communication Systems Engineering Department, Ben-Gurion University of the Negev, Beer-Sheva, 84105Israel
  5. 5.Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175USA

Personalised recommendations