Sublinear-time approximation of Euclidean minimum spanning tree

被引：0

作者：

Czumaj, A ^{[1
]}

Ergün, F ^{[1
]}

Fortnow, L ^{[1
]}

Magen, A ^{[1
]}

Newman, I ^{[1
]}

Rubinfeld, R ^{[1
]}

Sohler, C ^{[1
]}

机构：

[1] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA

来源：

PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2003年

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We consider the problem of finding the weight of a Euclidean minimum spanning tree for a set of n points in R-d. We focus on the situation when the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within 1 + is an element of using only (O) over tilde(rootn poly(1/is an element of)) queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbors queries.

引用

页码：813 / 822

页数：10

共 50 条

[11] Sensitivity Analysis of Euclidean Minimum Spanning Tree
Tournier, N.
Puech, W.
Subsol, G.
Pedeboy, J-P.
[J]. THREE-DIMENSIONAL IMAGE PROCESSING (3DIP) AND APPLICATIONS, 2010, 7526
[12] Kinetic Euclidean Minimum Spanning Tree in the Plane
Rahmati, Zahed
Zarei, Alireza
[J]. COMBINATORIAL ALGORITHMS, 2011, 7056 : 261 - 274
[13] Kinetic Euclidean minimum spanning tree in the plane
Rahmati, Zahed
Zarei, Alireza
[J]. JOURNAL OF DISCRETE ALGORITHMS, 2012, 16 : 2 - 11
[14] Drawing a tree as a minimum spanning tree approximation
Di Giacomo, Emilio
Didimo, Walter
Liotta, Giuseppe
Meijer, Henk
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2012, 78 (02) : 491 - 503
[15] Drawing a Tree as a Minimum Spanning Tree Approximation
Di Giacomo, Emilio
Didimo, Walter
Liotta, Giuseppe
Meijer, Henk
[J]. ALGORITHMS AND COMPUTATION, PT 2, 2010, 6507 : 61 - +
[16] Sublinear-time approximation algorithms for clustering via random sampling
Czumaj, Artur
Sohler, Christian
[J]. RANDOM STRUCTURES & ALGORITHMS, 2007, 30 (1-2) : 226 - 256
[17] A sublinear-time randomized approximation scheme for the robinson-foulds metric
Pattengale, Nicholas D.
Moret, Bernard M. E.
[J]. Lect. Notes Comput. Sci., 1600, (221-230):
[18] A sublinear-time randomized approximation scheme for the Robinson-Foulds metric
Pattengale, Nicholas D.
Moret, Bernard M. E.
[J]. RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, PROCEEDINGS, 2006, 3909 : 221 - 230
[19] Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Chen, Yen Hung
[J]. JOURNAL OF APPLIED MATHEMATICS, 2012,
[20] Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks
Henzinger, Monika
Krinninger, Sebastian
Nanongkai, Danupon
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2017, 13 (04)

← 1 2 3 4 5 →