, Volume 38, Issue 4, pp 577-589

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

  • Michael J. SpriggsAffiliated withSchool of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, N2L 3G1 Email author 
  • , J. Mark KeilAffiliated withDepartment of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, S7N 5A9 Email author 
  • , Sergei BespamyatnikhAffiliated withDepartment of Computer Science, Duke University, Box 90129, Durham, NC 27708 Email author 
  • , Michael SegalAffiliated withCommunication Systems Engineering Department, Ben-Gurion University of the Negev, Beer-Sheva, 84105 Email author 
  • , Jack SnoeyinkAffiliated withDepartment of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175 Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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