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 条

[1] Computing a (1+ε)-approximate geometric minimum-diameter spanning tree
Spriggs, MJ
Keil, JM
Bespamyatnikh, S
Segal, M
Snoeyink, J
ALGORITHMICA, 2004, 38 (04) : 577 - 589
[2] Facility location and the geometric minimum-diameter spanning tree
Gudmundsson, J
Haverkort, H
Park, SM
Shin, CS
Wolff, A
APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2002, 2462 : 146 - 160
[3] Facility location and the geometric minimum-diameter spanning tree
Gudmundsson, J
Haverkort, H
Park, SM
Shin, CS
Wolff, A
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2004, 27 (01): : 87 - 106
[4] Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
Seo, Dae Young
Lee, D. T.
Lin, Tien-Ching
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 283 - +
[5] A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree
Gfeller, Beat
Santoro, Nicola
Widmayer, Peter
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2011, 8 (01) : 1 - 12
[6] Computing a diameter-constrained minimum spanning tree in parallel
Deo, N
Abdalla, A
ALGORITHMS AND COMPLEXITY, 2000, 1767 : 17 - 31
[7] Computing a diameter-constrained minimum spanning tree in parallel
Deo, Narsingh
Abdalla, Ayman
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000, 1767 : 17 - 31
[8] ON THE MINIMUM DIAMETER SPANNING TREE PROBLEM
HASSIN, R
TAMIR, A
INFORMATION PROCESSING LETTERS, 1995, 53 (02) : 109 - 111
[9] On maximizing tree reliability based on minimum diameter spanning tree
Ishigaki, Genya
Yoshida, Masao
Shinomiya, Norihiko
2014 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS (APCCAS), 2014, : 603 - 606
[10] Decomposable algorithms for computing minimum spanning tree
Khedr, A
Bhatnagar, R
DISTRIBUTED COMPUTING: IWDC 2003, 2003, 2918 : 33 - 44

← 1 2 3 4 5 →