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

Keyphrases

• Euclidean Minimum Spanning Tree 100%
• Sublinear Time 100%
• High Probability 33%
• Approximate Nearest Neighbor Search 33%
• Geometric Data Structures 33%
• Orthogonal Range Searching 33%
• Efficient Access 33%

Mathematics

• Minimum Spanning Tree 100%
• Approximates 33%
• Probability Theory 33%
• Set Point 33%
• Data Structure 33%
• Cube 33%
• Nearest Neighbor 33%

Computer Science

• Minimum Spanning Tree 100%
• Data Structure 33%
• near neighbor query 33%
• Range Query 33%