TY - CONF AB - We consider the problem of finding the weight of a Euclidean minimum spanning tree for a set of n points in ℝ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 + ε using only \~{O}(√ poly(1/ε)) 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. AU - Magen, Avner AU - Ergun, Funda AU - Sohler, Christian AU - Rubinfeld, Ronitt AU - Czumaj, Artur AU - Newman, Ilan AU - Fortnow, Lance ID - 18791 SN - 0898715385 T2 - Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) TI - Sublinear Approximation of Euclidean Minimum Spanning Tree ER -