Sublinear-time approximation of Euclidean minimum spanning tree

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 813-822

  Czumaj, Artur ^a   Ergün, Funda ^b   Fortnow, Lance ^c   Magen, Avner ^d   Newman, Ilan ^e   Rubinfeld, Ronitt ^b   Sohler, Christian ^f  

^a New Jersey Institute of Technology   (United States)

^b Case Western Reserve University   (United States)

^c NEC LABORATORIES AMERICA   (United States)

^d UNIVERSITY OF TORONTO   (Canada)

^e UNIVERSITY OF HAIFA   (Israel)

^f UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PROBABILITY; TREES (MATHEMATICS);

EUCLIDEAN MINIMUM SPANNING TREE; SUBLINEAR-TIME APPROXIMATION;

APPROXIMATION THEORY;

EID: 0038754067     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. P. K. Agarwal. Range searching. In Handbook of Discrete and Computational Geometry, pp. 575-598. CRC Press, Boca Raton, FL, 1997.
2. P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry, 6:407-422, 1991.
3. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In Advances in Discrete and Computational Geometry, pp. 1-56. AMS Press, 1999.
4. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: Short, thin, and lanky. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 489-498, 1995.
5. S. Arya, D. M. Mount, and M. Smid. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Discrete & Computational Geometry, 13(2):91-107, 1999.
6. S. Arya and M. Smid. Efficient construction of a bounded-degree spanner with low weight. Algorithmica, 17(1):33-54, January 1997.
7. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry-Algorithms and Applications. Springer-Verlag, Berlin, 1997.
8. P. B. Callahan and S. R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 291-300, 1993.
9. B. Chazelle. Filtering Search: A new approach to query-answering SIAM Journal on Computing, 15:703-724, 1986.
10. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17:427-462, 1988.
11. B. Chazelle. Lower bounds for orthogonal range searching: I. The reporting case. Journal of the ACM, 37(2):200-212, April 1990.
12. B. Chazelle. Lower bounds for orthogonal range searching: II. The arithmetic model. Journal of the ACM, 37(3):439-463, June 1990.
13. B. Chazelle, R. Rubinfeld, and L. Trevisan. Approximating the minimum spanning tree weight in sublinear time. In Proceedings of the 28th Annual International Colloquium on Automata, Languages and Programming, pp. 190-200, 2001.
14. A. Czumaj and C. Sohler. Property testing with geometric queries. In Proceedings of the 9th Annual European Symposium on Algorithms, pp. 266-277, 2001.
15. D. Eppstein. Spanning trees and spanners. In Handbook of Computational Geometry, pp. 425-461. Elsevier Science B.V., 1997.
16. D. Eppstein. Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete & Computational Geometry, 13(1):111-122, Jan 1995
17. J. Erickson. On the relative complexity of some geometric problems. In Proceedings of the 7th Canadian Conference on Computational Geometry, pp. 85-90, 1995.
18. R. A. Finkel and J. L. Bentley. Quad trees: A data structure for retrieval on composite keys. Acta Informatica, 4:1-9, 1974.
19. M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann. Dynamic data structures for realtime management of large geormetric scences. In Proceedings of the 5th Annual European Symposium on Algorithms, pp. 157-170, 1997.
20. O. Goldreich, S. Goldwasser, and R. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, July 1998.
21. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Fast greedy algorithms for constructing sparse geometric spanners. SIAM Journal on Computing, 31(5): 1479-1500, 2002.
22. G. S. Lueker. A data structure for orthogonal range queries. In Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pp. 28-34, 1978.
23. J. Matoušek. Range searching with efficient hierarchical cutting. In Proceedings of the 8th Annual ACM Symposium on Computational Geometry, pp. 276-285, 1992.
24. J. S. B. Mitchell and J. O'Rourke. Computational geometry column 42. SIGACT News 32(3):63-72, 2001.
25. J. Ruppert and R. Seidel. Approximating the d-dimensional complete Euclidean graph. In Proceedings of the 3rd Canadian Conference on Computational Geometry, pp. 207-210, 1991.
26. J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry and Applications, 1(2):99-107, 1991.
27. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.
28. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
29. M. I. Shamos and D. Hoey. Closest-point problems. In Proceedings of the 16th IEEE Symposium on Foundations of Computer Science, pp. 151-162, 1975.
30. P. M. Vaidya. Minimum spanning trees in k-dimensional space. SIAM Journal on Computing, 17(3):572-582, 1988.
31. D. E. Willard. Predicate-Oriented Database Search Algorithms. PhD thesis, Harvard University, Aiken Computation Lab, Cambridge, MA, 1978. Report TR-20-78.
32. A. C.-C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721-736, November 1982.