Approximating the geometric minimum-diameter spanning tree.

Michael Spriggs, J. Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink

Research output: Contribution to conferencePaperpeer-review


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. In this paper, we present an approximation 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) improving the result by Gudmundsson et al. [4].
Original languageEnglish
Number of pages4
StatePublished - 1 Jan 2003
EventCCCG 2003, Halifax - Nova Scotia, United States
Duration: 11 Aug 200313 Aug 2003


ConferenceCCCG 2003, Halifax
Country/TerritoryUnited States
CityNova Scotia


Dive into the research topics of 'Approximating the geometric minimum-diameter spanning tree.'. Together they form a unique fingerprint.

Cite this