{"user_id":"15415","citation":{"mla":"Magen, Avner, et al. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, pp. 813–822.","ieee":"A. Magen <i>et al.</i>, “Sublinear Approximation of Euclidean Minimum Spanning Tree,” in <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, pp. 813–822.","apa":"Magen, A., Ergun, F., Sohler, C., Rubinfeld, R., Czumaj, A., Newman, I., &#38; Fortnow, L. (2003). Sublinear Approximation of Euclidean Minimum Spanning Tree. In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i> (pp. 813–822).","short":"A. Magen, F. Ergun, C. Sohler, R. Rubinfeld, A. Czumaj, I. Newman, L. Fortnow, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822.","ama":"Magen A, Ergun F, Sohler C, et al. Sublinear Approximation of Euclidean Minimum Spanning Tree. In: <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>. ; 2003:813–822.","bibtex":"@inproceedings{Magen_Ergun_Sohler_Rubinfeld_Czumaj_Newman_Fortnow_2003, title={Sublinear Approximation of Euclidean Minimum Spanning Tree}, booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}, author={Magen, Avner and Ergun, Funda and Sohler, Christian and Rubinfeld, Ronitt and Czumaj, Artur and Newman, Ilan and Fortnow, Lance}, year={2003}, pages={813–822} }","chicago":"Magen, Avner, Funda Ergun, Christian Sohler, Ronitt Rubinfeld, Artur Czumaj, Ilan Newman, and Lance Fortnow. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 813–822, 2003."},"department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"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."}],"year":"2003","publication_identifier":{"isbn":["0898715385"]},"language":[{"iso":"eng"}],"_id":"18791","date_updated":"2022-01-06T06:53:52Z","author":[{"full_name":"Magen, Avner","last_name":"Magen","first_name":"Avner"},{"first_name":"Funda","last_name":"Ergun","full_name":"Ergun, Funda"},{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"last_name":"Rubinfeld","full_name":"Rubinfeld, Ronitt","first_name":"Ronitt"},{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"last_name":"Newman","full_name":"Newman, Ilan","first_name":"Ilan"},{"full_name":"Fortnow, Lance","last_name":"Fortnow","first_name":"Lance"}],"status":"public","date_created":"2020-09-01T14:15:33Z","title":"Sublinear Approximation of Euclidean Minimum Spanning Tree","publication":"Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)","type":"conference","page":"813–822"}