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. .
|Number of pages||4|
|State||Published - 1 Jan 2003|
|Event||CCCG 2003, Halifax - Nova Scotia, United States|
Duration: 11 Aug 2003 → 13 Aug 2003
|Conference||CCCG 2003, Halifax|
|Period||11/08/03 → 13/08/03|