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

被引：0

作者：

Michael J. Spriggs

J. Mark Keil

Sergei Bespamyatnikh

Michael Segal

Jack Snoeyink

机构：

[1] School of Computer Science,

[2] University of Waterloo,undefined

[3] 200 University Avenue West,undefined

[4] Waterloo,undefined

[5] Ontario,undefined

[6] N2L 3G1,undefined

[7] Department of Computer Science,undefined

[8] University of Saskatchewan,undefined

[9] Saskatoon,undefined

[10] Saskatchewan,undefined

[11] S7N 5A9,undefined

[12] Department of Computer Science,undefined

[13] Duke University,undefined

[14] Box 90129,undefined

[15] Durham,undefined

[16] NC 27708,undefined

[17] Communication Systems Engineering Department,undefined

[18] Ben-Gurion University of the Negev,undefined

[19] Beer-Sheva,undefined

[20] 84105,undefined

[21] Department of Computer Science,undefined

[22] University of North Carolina at Chapel Hill,undefined

[23] Chapel Hill,undefined

[24] NC 27599-3175,undefined

来源：

Algorithmica | 2004年 / 38卷

关键词：

Minimum diameter spanning tree; Approximation algorithm; Geometric graph;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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

引用

页码：577 / 589

页数：12

共 50 条

[41] Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
Jochen Könemann
Asaf Levin
Amitabh Sinha
Algorithmica , 2005, 41 : 117 - 129
[42] Improved heuristics for the bounded-diameter minimum spanning tree problem
Singh, Alok
Gupta, Ashok K.
SOFT COMPUTING, 2007, 11 (10) : 911 - 921
[43] Greedy heuristics for the diameter-constrained minimum spanning tree problem
Requejo C.
Santos E.
Journal of Mathematical Sciences, 2009, 161 (6) : 930 - 943
[44] An adaptive heuristic to the bounded-diameter minimum spanning tree problem
Torkestani, Javad Akbari
SOFT COMPUTING, 2012, 16 (11) : 1977 - 1988
[45] Approximating the degree-bounded minimum diameter spanning tree problem
Könemann, J
Levin, A
Sinha, A
ALGORITHMICA, 2005, 41 (02) : 117 - 129
[46] Computing a minimum-dilation spanning tree is NP-hard
Cheong, Otfried
Haverkort, Herman
Lee, Mira
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 41 (03): : 188 - 205
[47] Computing all efficient solutions of the biobjective minimum spanning tree problem
Steiner, Sarah
Radzik, Tomasz
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (01) : 198 - 211
[48] Efficient construction of an approximate similarity graph for minimum spanning tree based clustering
Mishra, Gaurav
Mohanty, Sraban Kumar
APPLIED SOFT COMPUTING, 2020, 97
[49] Fast Approximate Minimum Spanning Tree Algorithm Based on K-Means
Zhong, Caiming
Malinen, Mikko
Miao, Duoqian
Franti, Pasi
COMPUTER ANALYSIS OF IMAGES AND PATTERNS, PT I, 2013, 8047 : 262 - 269
[50] New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
Steitz, Wolfgang
INFORMS JOURNAL ON COMPUTING, 2015, 27 (01) : 151 - 163

← 1 2 3 4 5 →