Approximating the weight of the Euclidean minimum spanning tree in sublinear time

被引：45

作者：

Czumaj, A ^{[1
]}

Ergün, F

Fortnow, L

Magen, A

Newman, I

Rubinfeld, R

Sohler, C

机构：

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

[2] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada

[3] NEC Res, Princeton, NJ 08540 USA

[4] Univ Chicago, Dept Comp Sci, Chicago, IL 60637 USA

[5] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 3G4, Canada

[6] Univ Haifa, Dept Comp Sci, IL-31999 Haifa, Israel

[7] MIT, CSAIL, Cambridge, MA 02139 USA

[8] Univ Paderborn, Heinz Nixdorf Inst, D-33102 Paderborn, Germany

[9] Univ Paderborn, Fac Comp Sci Elect Engn & Math, D-33102 Paderborn, Germany

来源：

SIAM JOURNAL ON COMPUTING | 2005年 / 35卷 / 01期

关键词：

sublinear algorithms; minimum spanning tree;

D O I：

10.1137/S0097539703435297

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in R-d. We focus on the setting where 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+epsilon using only (O) over tilde(root n poly(1/epsilon)) 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 neighbor queries.

引用

页码：91 / 109

页数：19

共 50 条

[1] Approximating the minimum spanning tree weight in sublinear time
Chazelle, B
Rubinfeld, R
Trevisan, L
[J]. SIAM JOURNAL ON COMPUTING, 2005, 34 (06) : 1370 - 1379
[2] Approximating the minimum spanning tree weight in sublinear time
Chazelle, B
Rubinfeld, R
Trevisan, L
[J]. AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 190 - 200
[3] Sublinear-time approximation of Euclidean minimum spanning tree
Czumaj, A
Ergün, F
Fortnow, L
Magen, A
Newman, I
Rubinfeld, R
Sohler, C
[J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 813 - 822
[4] ESTIMATING THE WEIGHT OF METRIC MINIMUM SPANNING TREES IN SUBLINEAR TIME
Czumaj, Artur
Sohler, Christian
[J]. SIAM JOURNAL ON COMPUTING, 2009, 39 (03) : 904 - 922
[5] Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric
Alvarez, Victor
Seidel, Raimund
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (02): : 94 - 98
[6] A sublinear time distributed algorithm for minimum-weight spanning trees
Garay, JA
Kutten, S
Peleg, D
[J]. SIAM JOURNAL ON COMPUTING, 1998, 27 (01) : 302 - 316
[7] 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
[8] Kinetic Euclidean Minimum Spanning Tree in the Plane
Rahmati, Zahed
Zarei, Alireza
[J]. COMBINATORIAL ALGORITHMS, 2011, 7056 : 261 - 274
[9] Kinetic Euclidean minimum spanning tree in the plane
Rahmati, Zahed
Zarei, Alireza
[J]. JOURNAL OF DISCRETE ALGORITHMS, 2012, 16 : 2 - 11
[10] On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees
G. Das
S. Kapoor
M. Smid
[J]. Algorithmica, 1997, 19 : 447 - 462

← 1 2 3 4 5 →