Geometric spanner networks

Geometric Spanner Networks

Volumn 9780521815130, Issue , 2007, Pages 1-500

  Narasimhan, Giri ^a   Smid, Michiel ^b  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; STUDENTS;

ALGORITHM DESIGN; ALGORITHMIC TECHNIQUES; BASIC PRINCIPLES; GEOMETRIC ANALYSIS; GEOMETRIC SPANNER; GRADUATE STUDENTS; NETWORK PROBLEMS; WELL-SEPARATED PAIR DECOMPOSITIONS;

DATA STRUCTURES;

EID: 84929759844     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511546884     Document Type: Book

References (298)

1. W. Ackermann. Zum Hilbertschen Aufbau der reellen Zahlen. Mathematische Annalen, 99:118-133, 1928.
2. P. K. Agarwal. Intersection and Decomposition Algorithms for Planar Arrangements. Cam-bridge University Press, Cambridge, UK, 1991.
3. P. K. Agarwal. Range searching. In J. E. Goodman and J. Orourke, editors, Handbook of Discrete and Computational Geometry, pages 809-837. CRC Press, Boca Raton, FL, 2nd edition, 2004.
4. 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.
5. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics, pages 1-56. American Mathematical Society, Providence, RI, 1999.
6. P. K. Agarwal, R. Klein, C. Knauer, S. Langer-man, P. Morin, M. Sharir, and M. Soss. Computing the detour and spanning ratio of paths, trees and cycles in 2d and 3d. Discrete & Computational Geometry, 2006.
7. P. K. Agarwal, Y. Wang, and P. Yin. Lower bound for sparse Euclidean spanners. In Proceedings of the 16th ACM-SIAM Symposium onDiscrete Algorithms, pages 670-671, 2005.
8. O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Gen-eralized self-approaching curves. Discrete Applied Mathematics, 109:3-24, 2001.
9. M. Aigner and G. M. Ziegler. Proofs From THE BOOK. Springer-Verlag, Berlin, 3rd edition, 2004.
10. N. Alon and Y. Azar. On-line Steiner trees in the Euclidean plane. Discrete & Computational Geometry, 10:113-121, 1993.
11. N. Alon and B. Schieber. Optimal preprocessing for answering on-line product queries. Technical Report 71/87, Tel-Aviv University, 1987.
12. H. Alt, C. Knauer, and C. Wenk. Matching polygonal curves with respect to the Frechet distance. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, volume 2010 of Lecture Notes in Computer Science, pages 63-74, Berlin, 2001. Springer-Verlag.
13. H. Alt, C. Knauer, and C. Wenk. Comparison of distance measures for planar curves. Algorithmica, 38:45-58, 2003.
14. I. Althofer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993.
15. S. Arikati, D. Z. Chen, L. P. Chew, G. Das, M. Smid, and C. D. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proceedings of the 4th European Symposium on Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 514-528, Berlin, 1996. Springer-Verlag.
16. B. Aronov, M. de Berg, O. Cheong, J. Gud-mundsson, H. Haverkort, and A. Vigneron. Sparse geometric graphs with small dilation. In Proceedings of the 16th International Symposium on Algorithms and Computation, volume 3827 of Lecture Notes in Computer Science, pages 50-59, Berlin, 2005. Springer-Verlag.
17. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45:753-782, 1998.
18. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: Short, thin, and lanky. In Proceedings of the 27th ACM Symposium on the Theory of Computing, pages 489-498, 1995.
19. S. Arya and D. M. Mount. Approximate range searching. Computational Geometry: Theory and Applications, 17:135-152, 2000.
20. S. Arya, D. M. Mount, N. S. Netanyahu, R. Sil-verman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of the ACM, 45:891-923, 1998.
21. S. Arya, D. M. Mount, and M. Smid. Randomized and deterministic algorithms for geometric spanners of small diameter. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 703-712, 1994.
22. S. Arya, D. M. Mount, and M. Smid. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry: Theory and Applications, 13:91-107, 1999.
23. S. Arya and M. Smid. Efficient construction of a bounded-degree spanner with low weight. Algorithmica, 17:33-54, 1997.
24. P. Assouad. Plongements lipschitziens dans RN. Bulletin de la Societe Mathematique de France, 111:429-448, 1983.
25. M. Ben-Or. Lower bounds for algebraic compu-tation trees. In Proceedings of the 15th ACM Symposium on the Theory of Computing, pages 80-86, 1983.
26. M. A. Bender and M. Farach-Colton. The LCA problem revisited. In Proceedings of the 4th Latin American Symposium on Theoretical Informatics, volume 1776 of Lecture Notes in Computer Science, pages 88-94, Berlin, 2000. Springer-Verlag.
27. J. L. Bentley. Decomposable searching problems. Information Processing Letters, 8:244-251, 1979.
28. J. L. Bentley. Fast algorithms for the geometric traveling salesperson problems. ORSA Journal on Computing, 4:387-411, 1992.
29. J. L. Bentley and J. H. Friedman. Fast algorithms for constructing minimal spanning trees in coordinate spaces. IEEE Trans. Comput, C-27:97-105, 1978.
30. J. L. Bentley, B. W. Weide, and A. C. Yao. Optimal expected-time algorthms for closest point problems. ACM Transactions on Mathematical Software, 6:563-580, 1980.
31. M. Bern and D. Eppstein. Approximation algori-thms for geometric problems. In D. S. Hoch-baum, editor, Approximation Algorithms for NP-Hard Problems, pages 296-345. PWS Publishing Company, Boston, MA, 1997.
32. M. Bern, D. Eppstein, and J. Gilbert. Prova-bly good mesh generation. Journal of Computer and System Sciences, 48:384-409, 1994.
33. S. Bespamyatnikh and M. Segal. Fast algorithms for approximating distances. Algorithmica, 33:263-269, 2002.
34. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448-461, 1973.
35. H. L. Bodlaender, G. Tel, andN. Santoro. Tradeoffs in non-reversing diameter. Nordic Journal of Computing, 1:111-134, 1994.
36. J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, Cambridge, UK, 1998.
37. B. Bollobas. Modern Graph Theory. Springer-Verlag, Berlin, 1998.
38. O. Boriivka. O jistem problemu minimalnim (About a certain minimal problem). Pmce Mor Pnrodoved. Spol. v Brne III (Acta Societ. Scient. Natur. Moravicae), 3:37-58, 1926a.
39. O. Boriivka. Pffspevek k resenl otazky eko-nomicke stavby electrovodnych siti (Con-tribution to the solution of a problem of economical construction of electrical networks). Elektrotechnicky obzor, 15:153-154, 1926b.
40. P. Bose, L. Devroye, W. Evans, and D. Kirk-patrick. On the spanning ratio of Gabriel graphs and f-skeletons. SIAM Journal on Discrete Mathematics, 20:412-427, 2006.
41. P. Bose, J. Gudmundsson, andP. Morin. Ordered theta graphs. Computational Geometry: Theory and Applications, 28:11-18, 2004a.
42. P. Bose, J. Gudmundsson, and M. Smid. Con-structing plane spanners of bounded degree and low weight. Algorithmica, 42:249-264, 2005.
43. P. Bose, A. Maheshwari, G. Narasimhan, M. Smid, and N. Zeh. Approximating geometric bottleneck shortest paths. Computational Geometry: Theory and Applications, 29:233-249, 2004b.
44. P. Bose and P. Morin. Competitive online routing in geometric graphs. Theoretical Computer Science, 324:273-288, 2004a.
45. P. Bose and P. Morin. Online routing in trian-gulations. SIAM Journal on Computing, 33:937-951, 2004b.
46. P. Bose, M. Smid, and D. Xu. Diamond triangu-lations contain spanners of bounded degree. Proceedings of the 17th International Sympo-sium on Algorithms and Computation. Lecture Notes in Computer Science, Berlin, 2006. Springer-Verlag
47. J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics, 52:46-52, 1985.
48. U. Brandes and D. Handke. NP-completeness results for minimum planar spanners. Discrete Mathematics and Theoretical Computer Science, 3:1-10, 1998.
49. A. Brandstadt, V. Chepoi, and F. F. Dragan. Distance approximating trees for chordal and dually chordal graphs. Journal of Algorithms, 30:166-184, 1999.
50. P. Burgisser, M. Clausen, and M. A. Shokrol-lahi. Algebraic Complexity Theory. Springer-Verlag, Berlin, 1997.
51. S. Cabello. Many distances in planar graphs. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pages 1213-1220, 2006
52. L. Cai. NP-completeness of minimum spanner problems. Discrete Applied Mathematics, 48:187-194, 1994.
53. L. Cai and D. Corneil. Tree spanners:An overview. Congressus Numerantium, 88:6576, 1992.
54. L. Cai and D. Corneil. Isomorphic tree spanner problems. Algorithmica, 14:138-153, 1995a.
55. L. Cai and D. Corneil. Tree spanners. SIAM Journal on Discrete Mathematics, 8:359387, 1995b.
56. P. B. Callahan. Optimal parallel all-nearest-neighbors using the well-separated pair de-composition. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pages 332-340, 1993.
57. P. B. Callahan. Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and its Applications. Ph.D. thesis, Department of Computer Science, Johns Hopkins University, Baltimore, MD, 1995.
58. P. B. Callahan and S. R. Kosaraju. A decomposi-tion of multi-dimensional point-sets with ap-plications to k-nearest-neighbors and w-body potential fields. In Proceedings of the 24th ACM Symposium on the Theory of Computing, pages 546-556, 1992.
59. P. B. Callahan and S. R. Kosaraju. Faster algo-rithms for some geometric graph problems in higher dimensions. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pages 291-300, 1993.
60. P. B. Callahan and S. R. Kosaraju. Algorithms for dynamic closest-pair and w-body potential fields. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, pages 263-272, 1995a.
61. P. B. Callahan and S. R. Kosaraju. A decompo-sition of multidimensional point sets with ap-plications to k-nearest-neighbors and w-body potential fields. Journal of the ACM, 42:6790, 1995b.
62. T. M. Chan. Approximate nearest neighbor queries revisited. Discrete & Computational Geometry, 20:359-373, 1998.
63. T. M. Chan. On enumerating and selecting distances. International Journal of Com-putational Geometry & Applications, 11:291-304, 2001.
64. B. Chandra. Constructing sparse spanners for most graphs in higher dimensions. Information Processing Letters, 51:289-294, 1994.
65. B. Chandra, G. Das, G. Narasimhan, and J. Soares. New sparseness results on graph spanners. International Journal ofComputa-tional Geometry & Applications, 5:125-144, 1995.
66. A. K. Chandra, S. Fortune, and R. J. Lipton. Unbounded fan-in circuits and associative functions. Journal of Computer and System Sciences, 30:222-234, 1985.
67. B. Chandra, H. Karloff, and C. Tovey. New results on the old k-opt algorithm for the traveling salesman problem. SIAM Journal on Computing, 28:1998-2029, 1999.
68. M. S. Chang, N.-F. Huang, and C.-Y. Tang. An optimal algorithm for constructing oriented Voronoi diagrams and geographic neighborhood graphs. Information Processing Letters, 35:255-260, 1990.
69. B. Chazelle. Computing on a free tree via complexity-preserving mappings. Algorithmica, 2:337-361, 1987.
70. B. Chazelle. The Discrepancy Method. Cambridge University Press, Cambridge, UK, 2000a.
71. B. Chazelle. A minimum spanning tree algorithm with inverse-Ackermann type complexity. Journal of the ACM, 47:1028-1047, 2000b.
72. B. Chazelle and L. J. Guibas. Fractional cascading:I. A data structuring technique. Algorithmica, 1:133-162, 1986a.
73. B. Chazelle and L. J. Guibas. Fractional cascading:II. Applications. Algorithmica, 1:163-191, 1986b.
74. O. Cheong and H. Haverkort and M. Lee. Computing a minimum-dilation spanning tree is NP-hard. 2006. Manuscript.
75. D. Z. Chen, G. Das, and M. Smid. Lower bounds for computing geometric spanners and approximate shortest paths. Discrete Applied Mathematics, 110:151-167, 2001.
76. D. Cheriton and R. E. Tarjan. Finding minimum spanning trees. SIAM Journal on Computing, 5:724-742, 1976.
77. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-509, 1952.
78. L. P. Chew. There is a planar graph almost as good as the complete graph. In Proceedings of the 2nd ACM Symposium on Computational Geometry, pages 169-177, 1986.
79. L. P. Chew. There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences, 39:205-219, 1989.
80. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. In J. F. Traub, editor, Symposium on New Directions and Recent Results in Algorithms and Complexity, page 441, New York, 1976. Academic Press.
81. K. L. Clarkson. Approximation algorithms for shortest path motion planning. In Proceedings of the 19th ACM Symposium on the Theory of Computing, pages 56-65, 1987.
82. K. L. Clarkson. An algorithm for geometric minimum spanning trees requiring nearly linear expected time. Algorithmica, 4:461-469, 1989.
83. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing, 28:210-236, 1998.
84. R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica, 3:329-346, 1988.
85. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2nd edition, 2001.
86. A. Czumaj and H. Zhao. Fault-tolerant geometric spanners. Discrete & Computational Geometry, 32:207-230, 2004.
87. G. Das. Approximation Schemes in Computational Geometry. Ph.D. thesis, University of Wisconsin, 1990.
88. G. Das. The visibility graph contains a bounded-degree spanner. In Proceedings of the 9th Canadian Conference on Computational Geometry, pages 70-75, 1997.
89. G. Das and P. J. Heffernan. Constructing degree-3 spanners with other sparseness properties. International Journal of Foundations of Computer Science, 7:121-135, 1996.
90. G. Das, P. Heffernan, and G. Narasimhan. Optimally sparse spanners in 3-dimensional Euclidean space. In Proceedings of the 9th ACM Symposium on Computational Geometry, pages 53-62, 1993.
91. G. Das and D. Joseph. Which triangulations approximate the complete graph? In Proceedings of the International Symposium on Optimal Algorithms, volume 401 of Lecture Notes in Computer Science, pages 168-192, Berlin, 1989. Springer-Verlag.
92. G. Das, S. Kapoor, and M. Smid. On the com-plexity of approximating Euclidean traveling salesman tours and minimum spanning trees. Algorithmica, 19:447-460, 1997.
93. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. International Journal of Computational Geometry & Applications, 7:297-315, 1997.
94. G. Das and G. Narasimhan. Short cuts in higher dimensional space. In Proceedings of the 7th Canadian Conference on Computational Geometry, pages 103-108, 1995.
95. G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, pages 215-222, 1995.
96. A. Datta, H.-P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for-point clustering problems. Journal of Algorithms, 19:474-503, 1995.
97. W. H. E. Day and H. Edelsbrunner. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification, 1:7-24, 1984.
98. M. de Berg, M. Van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry:Algorithms and Applications. Springer-Verlag, Berlin, 2nd edition, 2000.
99. M. T. Dickerson, R. L. Drysdale, and J. R. Sack. Simple algorithms for enumerating interpoint distances and finding k nearest neighbors. International Journal ofComputational Geo-metry & Applications, 2:221-239, 1992.
100. M. T. Dickerson and D. Eppstein. Algorithms for proximity problems in higher dimensions. Computational Geometry: Theory and Appli-cations, 5:277-291, 1996.
101. R. Diestel. Graph Theory. Springer-Verlag, Berlin, 2nd edition, 2000.
102. E. W. Dijkstra. A note on two problems in con-nexion with graphs. Numerische Mathematik, 1:269-271, 1959.
103. H. N. Djidjev. On-line algorithms for shortest path problems on planar digraphs. In Proceedings of the 22nd Workshop on Graph-Theoretic Concepts in Computer Science, volume 1197 of Lecture Notes in Computer Science, pages 151-165, Berlin, 1997. Springer-Verlag.
104. D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete & Computational Geometry, 5:399-407, 1990.
105. D. P. Dobkin and R. J. Lipton. On the complexity of computations under varying sets of primitives. Journal of Computer and System Sciences, 18:86-91, 1979.
106. R. L. Drysdale, S. McElfresh, and J. S. Snoeyink. On exclusion regions for optimal triangulations. Discrete Applied Mathematics, 109:49-65, 2001.
107. D.-Z. Du and F. K. Hwang. An approach for proving lower bounds: Solution of Gilbert-Pollak conjecture on Steiner ratio. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pages 76-85, 1990a.
108. D.-Z. Du and F. K. Hwang. A proof of Gilbert-Pollak's conjecture on the Steiner ratio. Algorithmica, 7:121-136, 1992.
109. D.-Z. Du and F. K. Hwang. The state of art on Steiner ratio problems. In D.-Z. Du and F. K. Hwang, editors, Computing in Euclidean Geometry, pages 195-224. World Scientific, Singapore, 2nd edition, 1995.
110. D. Z. Du and F. K. Hwang. The Steiner ratio conjecture of Gilbert and Pollak is true. Proceedings of the National Academy of Sciences of the United States of America, 87:9464-9466, 1990b.
111. A. Dumitrescu, A. Ebbers-Baumann, A. Grime, R. Klein, and G. Rote. On geometric dilation and halving chords. In Proceedings of the 9th Workshop on Algorithms and Data Structures, volume 3608 of Lecture Notes in Computer Science, pages 244-255, Berlin, 2005a. Springer-Verlag.
112. A. Dumitrescu, A. Grime, and G. Rote. Improved lower bounds on the geometric dilation of point sets. In Abstracts of the 21st European Workshop on Computational Geometry, pages 37-40, 2005b.
113. C. A. Duncan. Balanced Aspect Ratio Trees. Ph.D. thesis, Department of Computer Science, Johns Hopkins University, Baltimore, MD, 1999.
114. C. A. Duncan, M. T. Goodrich, and S. Kobourov. Balanced aspect ratio trees: Combining the adVantages of k-d trees and octrees. Journal of Algorithms, 38:303-333, 2001.
115. A. Ebbers-Baumann, R. Klein, E. Langetepe, and A. Lingas. A fast algorithm for approximating the detour of a polygonal chain. In Proceedings of the 9th European Symposium on Algorithms, volume 2161 of Lecture Notes in Computer Science, pages 321-332, Berlin, 2001. Springer-Verlag.
116. A. Ebbers-Baumann, A. Grime, and R. Klein. The geometric dilation of finite point sets. In Proceedings of the 14th International Symposium on Algorithms and Computation, volume 2906 of Lecture Notes in Computer Science, pages 250-259, Berlin, 2003. Springer-Verlag
117. A. Ebbers-Baumann, A. Grime, and R. Klein. Geometric dilation of closed planar curves: A new lower bound. In Abstracts of the 20th European Workshop on Computational Geometry, pages 123-126, 2004a.
118. A. Ebbers-Baumann, R. Klein, E. Langetepe, and A. Lingas. A fast algorithm for approximating the detour of a polygonal chain. Computational Geometry: Theory and Applications, 27:123-134, 2004b.
119. A. Ebbers-Baumann, A. Grime, M. Karpinski, R. Klein, C. Knauer, and A. Lingas. Embedding point sets into plane graphs of small dilation. In Proceedings of the 16th International Symposium on Algorithms and Computation, volume 3827 of Lecture Notes in Computer Science, pages 5-16, Berlin, 2005. Springer-Verlag.
120. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
121. D. Eppstein. Beta-skeletons have unbounded di-lation. Computational Geometry: Theory and Applications, 23:43-52, 2002.
122. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook ofComputational Geometry, pages 425-461. Elsevier Science, Amsterdam, 2000.
123. D. Eppstein and K. A. Wortman. Minimum dilation stars. In Proceedings of the 21st ACM Symposium on Computational Geometry, pages 321-326, 2005.
124. J. Erickson. New lower bounds for Hopcroft's problem. Discrete & Computational Geometry, 16:389-418, 1996.
125. J. Erickson. On the relative complexities of some geometric problems. In Proceedings of the 7th Canadian Conference on Computational Geometry, pages 85-90, 1995.
126. S. Even. Graph Algorithms. W. H. Freeman, New York, 1979.
127. M. Farshi and J. Gudmundsson. Experimental study of geometric t-spanners. In Proceedings of the 13th European Symposium on Algorithms, volume 3669 of Lecture Notes in Computer Science, pages 556-567, Berlin, 2005. Springer-Verlag.
128. M. Farshi, P. Giannopoulos, and J. Gudmunds-son. Finding the best shortcut in a geometric network. In Proceedings of the 21st ACM Symposium on Computational Geometry, pages 327-335, 2005.
129. L. Few. The shortest path and the shortest road through n points in a region. Mathematika, 2:141-144, 1955.
130. L. R. Ford and S. M. Johnson. A tournament problem. The American Mathematical Monthly, 66:387-389, 1959.
131. G. N. Frederickson. A data structure for dy-namically maintaining rooted trees. Journal of Algorithms, 24:37-65, 1997.
132. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing, 16:1004-1022, 1987.
133. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
134. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533-551, 1994.
135. H. Freudenthal. Simplizialzerlegungen von beschrankter Flachheit. Annals of Mathematics, 43:580-582, 1942.
136. J. Gao, L. J. Guibas, and A. Nguyen. Deformable spanners and applications. Computational Geometry: Theory and Applications, 35:2-19, 2006.
137. J. Gao and L. Zhang. Well-separated pair decomposition for the unit-disk graph metric and its applications. SIAM Journal on Computing, 35:151-169, 2005.
138. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
139. M. R. Garey, R. L. Graham, and D. S. Johnson. The complexity of computing Steiner minimal trees. SIAM Journal on Applied Mathematics, 32:835-859, 1977.
140. E. N. Gilbert and H. O. Pollak. Steiner minimal trees. SIAM Journal on Applied Mathematics, 16:1-29, 1968.
141. T. Gonzalez. Algorithms on sets and related problems. Technical Report, Department of Computer Science, University of Oklahoma, Norman, 1975.
142. J. E. Goodman and J. Orourke, editors. Hand-book of Discrete and Computational Geometry CRC Press, Boca Raton, FL, 2nd edition, 2004
143. S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh. I/O-efficient well-separated pair decomposition and its applications. [See notes] Algorithmica, 45:585-614, 2006.
144. R. L. Graham and P. Hell. On the history of the minimum spanning tree problem. Annals of the History of Computing, 7:43-57, 1985.
145. L. F. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. MIT Press, Cambridge, MA, 1988.
146. A. Grime. Umwege in Polygonen. Master's thesis, Universitat Bonn, Germany, 2002.
147. A. Grime, R. Klein, and E. Langetepe. Computing the detour of polygons. In Abstracts of the 19th European Workshop on Computational Geometry, pages 61-64, 2003.
148. M. Griinewald, T. Lukovszki, C. Schindelhauer, and K. Volbert. Distributed maintenance of resource efficient wireless network topologies. In Proceedings of the 8th Euro-Par Conference, volume 2400 of Lecture Notes in Computer Science, pages 935-946, Berlin, 2002. Springer-Verlag
149. J. Gudmundsson and C. Knauer. Dilation and detours in geometric networks. In T. F. Gon-zalez, editor, Handbook on Approximation Algorithms and Metaheuristics. Chapman & Hall/CRC, Boca Raton, FL, 2006.
150. J. Gudmundsson and M. Smid. On spanners of geometric graphs. In Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, volume 4059 of Lecture Notes in Computer Science, pages 388-399, Berlin, 2006. Springer-Verlag
151. J. Gudmundsson, C. Levcopoulos, and G. Nara-simhan. Fast greedy algorithms for constructing sparse geometric spanners. SIAM Journal on Computing, 31:1479-1500, 2002a.
152. J. Gudmundsson, C. Levcopoulos, G. Nara-simhan, and M. Smid. Approximate distance oracles for geometric graphs. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pages 828-837, 2002b.
153. J. Gudmundsson, C. Levcopoulos, G. Nara-simhan, and M. Smid. Approximate distance oracles revisited. In Proceedings of the 13th International Symposium on Algorithms and Computation, volume 2518 of Lecture Notes in Computer Science, pages 357-368, Berlin, 2002c. Springer-Verlag.
154. J. Gudmundsson, C. Levcopoulos, G. Nara-simhan, and M. Smid. Approximate distance oracles for geometric spanners. Manuscript, 2004.
155. J. Gudmundsson, G. Narasimhan, and M. Smid. Fast pruning of geometric spanners. In Pro-ceedings of the 22nd Symposium on Theoretical Aspects of Computer Science, volume 3404 of Lecture Notes in Computer Science, pages 508-520, Berlin, 2005. Springer-Verlag.
156. A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pages 534-543, 2003.
157. D. Gusfield. Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge, UK, 1997.
158. D. Handke. Graphs with Distance Guarantees. Ph.D. thesis, Fakultat fur Mathematik und Informatik, Universitat Konstanz, Konstanz, Germany, 1999
159. S. Har-Peled and M. Mendel. Fast construction of nets in low-dimensional metrics and their applications. SIAM Journal on Computing, 35:1148-1184, 2006.
160. F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972.
161. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13:338-355, 1984.
162. J. Heinonen. Lectures on Analysis on Metric Spaces. Springer-Verlag, Berlin, 2001.
163. K. Hildrum, J. Kubiatowicz, S. Ma, and S. Rao. A note on the nearest neighbor in growth-restricted metrics. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algo-rithms, pages 560-561, 2004.
164. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. Elsevier Science, Amsterdam, 1992.
165. C. Icking and R. Klein. Searching for the kernel of a polygon: A competitive strategy. In Proceedings of the 11th ACM Symposium on Computational Geometry, pages 258-266, 1995.
166. C. Icking, R. Klein, and E. Langetepe. Self-approaching curves. Mathematical Proceedings ofthe Cambridge Philosophical Society, 125:441-453, 1999.
167. H. Imai and Ta. Asano. Dynamic orthogonal segment intersection search. Journal of Algorithms, 8:1-18, 1987.
168. V. Jarnlk. O jistem problemu minimalnlm. Prace Moravske Prirodovedecke Spolecnosti, 6:57-63, 1930.
169. D. B. Johnson and T. Mizoguchi. Selecting the K th element in X + Y and X1 + X2 + ooo + Xm. SIAM Journal on Computing, 7:147-153, 1978.
170. D. S. Johnson and C. H. Papadimitriou. Com-putational complexity and the traveling salesman problem. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem, pages 68-74. John Wiley & Sons, New York, 1985.
171. P. Jones. Rectifiable sets and the traveling salesman problem. Inventiones Mathematicae, 102:1-15, 1990.
172. C. Jordan. Sur les assemblages de lignes. Journal fur die reine und angewandte Mathematik, 70:185-190, 1869.
173. M. I. Karavelas and L. J. Guibas. Static and kinetic geometric spanners with applications. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 168-176, 2001.
174. D. R. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In Proceedings of the 34th ACM Symposium on the Theory of Computing, pages 741-750, 2002.
175. D. R. Karger, P. N. Klein, and R. E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM, 42:321-328, 1995.
176. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, AdVances in Computing Research, pages 85-103. Plenum Press, 1972.
177. R. M. Karp and J. M. Steele. Probabilistic analysis of heuristics. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem, pages 181-205. John Wiley & Sons, New York, 1985.
178. J. M. Keil. Approximating the complete Euclidean graph. In Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, volume 318 of Lecture Notes in Computer Science, pages 208-213, Berlin, 1988. Springer-Verlag.
179. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7:13-28, 1992.
180. C. Kenyon and R. Kenyon. How to take short cuts. Discrete & Computational Geometry, 8:251-264, 1992.
181. S. Khuller, B. Raghavachari, and N. E. Young. Balancing minimum spanning trees and shortest-path trees. Algorithmica, 14:305-321, 1995.
182. R. Klein, C. Knauer, G. Narasimhan, and M. Smid. Exact and approximation algorithms for computing the dilation spectrum of paths, trees, and cycles. In Proceedings of the 16th International Symposium on Algorithms and Computation, volume 3827 of Lecture Notes in Computer Science, pages 849-858, Berlin, 2005. Springer-Verlag.
183. R. Klein and M. Kutz. Computing geometric minimum-dilation graphs is NP-hard. Pro-ceedings of the 14th International Symposium on Graph Drawing. Lecture Notes in Computer Science, Berlin, 2006. Springer-Verlag.
184. D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 3rd edition, 1997.
185. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, 1973.
186. R. Krauthgamer and J. R. Lee. The black-box complexity of nearest neighbor search. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming, volume 3142 of Lecture Notes in Computer Science, pages 858-869, Berlin, 2004a. Springer-Verlag
187. R. Krauthgamer and J. R. Lee. Navigating nets: Simple algorithms for proximity search. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pages 798-807, 2004b.
188. R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. Geometric and Functional Analysis, 15:839-858, 2005.
189. J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings ofthe American Mathematical Society, 7:48-50, 1956.
190. D. Krznaric. Progress in Hierarchical Clustering & Minimum Weight Triangulation. Ph.D. thesis, Department of Computer Science, Lund University, Lund, Sweden, 1997.
191. D. Krznaric, C. Levcopoulos, and B. J. Nilsson. Minimum spanning trees in d dimensions. Nordic Journal of Computing, 6:446-461, 1999.
192. H. W. Kuhn. Some combinatorial lemmas in topology. IBM Journal of Research and Development, 4:518-524, 1960.
193. J. A. La Poutre. New techniques for the Union-Find problem. In Proceedings ofthe1stACM-SIAM Symposium on Discrete Algorithms, pages 54-63, 1990.
194. T. J. Laakso. Plane with A^-weighted metric not bilipschitz embeddable to Rn. Bulletin of the London Mathematical Society, 34:667-676, 2002.
195. S. Langerman, P. Morin, andM. Soss. Computing the maximum detour and spanning ratio of planar paths, trees and cycles. In Proceedings of the 19th Symposium on Theoretical Aspects of Computer Science, volume 2285 of Lecture Notes in Computer Science, pages 250-261, Berlin, 2002. Springer-Verlag.
196. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, New York, 1985.
197. H.-O. Le and V. B. Le. Optimal tree 3-spanners in directed path graphs. Networks, 34:81-87, 1999.
198. A. W. Lee. Diamonds are a Plane Graph's Best Friend. Master's thesis, School of Computer Science, Carleton University, Ottawa, 2004.
199. D. T. Lee and B. J. Schachter. Two algorithms for constructing Delaunay triangulations. International Journal of Computer and Information Sciences, 9:219-242, 1980.
200. D. T. Lee and C. K. Wong. Quintary trees: A file structure for multidimensional database systems. ACM Transactions on Database Systems, 5:339-353, 1980.
201. D. T. Lee and Y. F. Wu. Geometric complexity of some location problems. Algorithmica, 1:193-211, 1986.
202. H.-P. Lenhof and M. Smid. Sequential and parallel algorithms for the k closest pairs problem. International Journal of Computational Geometry & Applications, 5:273-288, 1995.
203. C. Levcopoulos and A. Lingas. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica, 8:251-256, 1992.
204. C. Levcopoulos, G. Narasimhan, and M. Smid. Efficient algorithms for constructing fault-tolerant geometric spanners. In Proceedings of the 30th ACM Symposium on the Theory of Computing, pages 186-195, 1998.
205. C. Levcopoulos, G. Narasimhan, and M. Smid. Improved algorithms for constructing fault-tolerant spanners. Algorithmica, 32:144-156, 2002.
206. X.-Y. Li and Y. Wang. Efficient construction of low weighted bounded degree planar spanner. International Journal of Computational Geometry & Applications, 14:69-84, 2004.
207. S. Lin. Computer solutions of the traveling salesman problem. Bell Systems Technical Journal, 44:2245-2269, 1965.
208. S. Lin and B. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21:498-516, 1973.
209. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
210. R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9:615-627, 1980.
211. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36:177-189, 1979.
212. G. S. Lueker. A data structure for orthogonal range queries. In Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pages 28-34, 1978.
213. T. Lukovszki. New results on fault tolerant geometric spanners. In Proceedings of the 6th Workshop on Algorithms and Data Structures, volume 1663 of Lecture Notes in Computer Science, pages 193-204, Berlin, 1999a. Springer-Verlag.
214. T. Lukovszki. New Results on Geometric Spanners and Their Applications. Ph.D. thesis, Department of Computer Science, University of Paderborn, Paderborn, Germany, 1999b.
215. T. Lukovszki, A. Maheshwari, and N. Zeh. I/O-efficient batched range counting and its applications to proximity problems. In Proceedings of the 21st Conference on the Foundations of Software Technology and The-oretical Computer Science, volume 2245 of Lecture Notes in Computer Science, pages 244-255, Berlin, 2001. Springer-Verlag.
216. M. S. Madanlal, G. Venkatesan, and C. Pandu Rangan. Tree 3-spanners on interval, permu-tation and regular bipartite graphs. Information Processing Letters, 59:97-102, 1996.
217. A. Maheshwari, M. Smid, and N. Zeh. I/O-efficient shortest-path queries in geometric spanners. In Proceedings of the 7th Workshop on Algorithms and Data Structures, volume 2125 of Lecture Notes in Computer Science, pages 287-299, Berlin, 2001. Springer-Verlag.
218. U. Manber. Introduction to Algorithms: A Creative Approach. Addison-Wesley, Reading, MA, 1989.
219. U. Manber and M. Tompa. The complexity of problems on probabilistic, nondeterministic, and alternating decision trees. Journal of the ACM, 32:720-732, 1985.
220. J. Matousek. Geometric Discrepancy: An Illus-trated Guide. Springer-Verlag, Berlin, 1999.
221. J. Matoussek. Lectures on Discrete Geometry. Springer-Verlag, Berlin, 2002.
222. K. Mehlhorn. Data Structures and Algorithms 3: Multi-dimensional Searching and Compu-tational Geometry. Springer-Verlag, Berlin, 1984a.
223. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, Berlin, 1984b.
224. K. Mehlhorn and S. Naher. Dynamic fractional cascading. Algorithmica, 5:215-241, 1990.
225. K. Menger. Zur allgemeinen Kurventheorie. Fundamenta Mathematicae, 10:96-115, 1927.
226. J. W. Milnor. On the Betti numbers of real alge-braic varieties. Proceedings of the American Mathematical Society, 15:275-280, 1964.
227. J. W. Milnor. Singular Points of Complex Hype-rsurfaces. Princeton University Press, Prince-ton, NJ, 1968.
228. J. S. B. Mitchell. Guillotine subdivisions ap-proximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, fc-MST, and related problems. SIAM Journal on Computing, 28:1298-1309, 1999.
229. J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Ur-rutia, editors, Handbook of Computational Geometry, pages 633-701. Elsevier Science, Amsterdam, 2000.
230. M. Mitzenmacher and E. Upfal. Probability and Computing. Cambridge University Press, Cambridge, UK, 2005.
231. L. Monier. Combinatorial solutions of multidi-mensional divide-and-conquer recurrences. Journal of Algorithms, 1:60-74, 1980.
232. R. Motwani and P. RaghaVan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 1995.
233. D. M. Mount. Dumbbell trees. Unpublished manuscript, 1994.
234. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1994.
235. W. Mulzer and G. Rote. Minimum weight triangulation is NP-hard. Proceedings of the 22nd ACM Symposium on Computational Geometry, 1-10, 2006.
236. G. Narasimhan and M. Smid. Approximation algorithms for the bottleneck stretch factor problem. Nordic Journal of Computing, 9:13-31, 2002.
237. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing, 30:978-989, 2000.
238. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean paths, cycles and trees. Technical Report 9, Department of Computer Science, University of Magdeburg, Magdeburg, Germany, 1999.
239. G. Narasimhan and M. Zachariasen. Geometric minimum spanning trees via well-separated pair decompositions. ACM Journal ofExper-imental Algorithmics, 6, 2001. Article 6.
240. G. Narasimhan, J. Zhu, and M. Zachariasen. Experiments with computing geometric minimum spanning trees. In Proceedings of the 2nd Workshop on Algorithm Engineering and Experiments, pages 183-196, 2000.
241. G. Navarro and R. Paredes. Practical construction of metric t-spanners. In Proceedings of the 5th Workshop on Algorithm Engineering and Experiments, pages 69-81, 2003.
242. J. Nesetril. Some remarks on the history of MST-problem. Archivum Mathematicum, 33:15-22, 1997.
243. J. Nievergelt and F. P. Preparata. Plane-sweep algorithms for intersecting geometric figures. Communications of the ACM, 25:739-747, 1982.
244. J. Orourke. Computational Geometry in C. Cambridge University Press, Cambridge, UK, 2nd edition, 1998.
245. C. H. Papadimitriou. The Euclidean traveling salesman problem is NP-complete. Theoretical Computer Science, 4:237-244, 1977.
246. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, 2000.
247. D. Peleg and A. A. Schaffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
248. D. Peleg and J. D. Ullman. An optimal syn-chronizer for the hypercube. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pages 77-85, 1987.
249. D. Peleg and J. D. Ullman. An optimal syn-chronizer for the hypercube. SIAM Journal on Computing, 18:740-747, 1989.
250. S. Pettie and V. Ramachandran. An optimal minimum spanning tree algorithm. Journal of the ACM, 49:16-34, 2002.
251. F. P. Preparata andM. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, Berlin, 1988.
252. R. C. Prim. Shortest connection networks and some generalizations. Bell Systems Technical Journal, 36:1389-1401, 1957.
253. E. Prisner. Distance approximating spanning trees. In Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 499-510, Berlin, 1997. Springer-Verlag.
254. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 35:668-676, 1990.
255. M. O. Rabin. Proving simultaneous positivity of linear forms. Journal of Computer and System Sciences, 6:639-650, 1972.
256. S. B. Rao and W. D. Smith. Approximating geometrical graphs via “spanners” and “banyans.” In Proceedings of the 30th ACM Symposium on the Theory of Computing, pages 540-550, 1998.
257. E. M. Reingold. On the optimality of some set algorithms. Journal of the ACM, 19:649-659, 1972.
258. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6:563-581, 1977.
259. J. Ruppert and R. Seidel. Approximating the d-dimensional complete Euclidean graph. In Proceedings of the 3rd Canadian Conference on Computational Geometry, pages 207-210, 1991.
260. J.-R. Sack and J. Urrutia, editors. Handbook of Computational Geometry. Elsevier Science, Amsterdam, 2000.
261. S. Sahni and T. Gonzalez. P-complete ap-proximation problems. Journal of the ACM, 23:555-565, 1976.
262. J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry & Applications, 1:99-107, 1991.
263. J. S. Salowe. Enumerating interdistances in space. International Journal of Computational Geometry & Applications, 2:49-59, 1992.
264. J. S. Salowe. Euclidean spanner graphs with degree four. Discrete Applied Mathematics, 54:55-66, 1994.
265. F. Santos and R. Seidel. A better upper bound on the number of triangulations of a planar point set. Journal of Combinatorial Theory, Series A, 102:186-193, 2003.
266. B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplifications and par-allelisations. SIAM Journal on Computing, 17:327-334, 1988.
267. O. Schwarzkopf. Dynamic maintenance of geo-metric structures made easy. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pages 197-206, 1991.
268. S. Semmes. On the nonexistence of bi-Lipschitz parameterizations and geometric problems about A^-weights. Revista Matematica Iberoamericana, 12:337-410, 1996.
269. M. I. Shamos and D. Hoey. Closest-point problems. In Proceedings of the 16th IEEE Symposium on Foundations of Computer Science, pages 151-162, 1975.
270. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge, UK, 1995.
271. M. Sigurd and M. Zachariasen. Construction of minimum-weight spanners. In Proceedings of the 12th European Symposium on Algorithms, volume 3221 of Lecture Notes in Computer Science, pages 797-808, Berlin, 2004. Springer-Verlag.
272. M. Smid. Closest-point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877-935. Elsevier Science, Amsterdam, 2000.
273. M. Smid. Geometric spanners with few edges and degree five. In Proceedings of the 12th Computing: The Australasian Theory Symposium, volume 51 of Conferences in Research and Practice in Information Tech-nology, pages 7-9, Sydney, 2006. Australian Computer Society Inc.
274. M. Smid. Maintaining the minimal distance of a point set in polylogarithmic time. Discrete & Computational Geometry, 7:415-431, 1992.
275. W. D. Smith. Studies in Computational Geometry Motivated by Mesh Generation. Ph.D. thesis, Priceton University, Princeton, NJ, 1988.
276. J. Soares. Approximating Euclidean distances by small degree graphs. Discrete & Computational Geometry, 11:213-233, 1994.
277. J. Soares. Graph spanners: A survey. Congres-sus Numerantium, 89:225-238, 1992.
278. J. M. Steele and T. L. Snyder. Worst-case growth rates of some classical problems of combinatorial optimization. SIAM Journal on Computing, 18:278-287, 1989.
279. J. M. Steele and A. C. Yao. Lower bounds for algebraic decision trees. Journal of Algorithms, 3:1-8, 1982.
280. H.-H. St0lum. River meandering as a self-organizational process. Science, 271:1710-1713, 1996.
281. K. Talwar. Bypassing the embedding: Approxi-mation schemes and compact representations of low dimensional metrics. In Proceedings of the 36th ACM Symposium on the Theory of Computing, pages 281-290, 2004.
282. R. E. Tarjan. Efficiency of a good but not linear set-union algorithm. Journal of the ACM, 22:215-225, 1975.
283. S. R. Tate and K. Xu. General-purpose spatial decomposition algorithms: Experimental results. In Proceedings of the 2nd Workshop on Algorithm Engineering and Experiments, pages 197-215, 2000
284. R. Thom. Sur l'homologie des varietes algebriques reeiles. In S. S. Cairns, editor, Differential and Combinatorial Topology, pages 255-265. Princeton University Press, Princeton, NJ, 1965.
285. M. Thorup. Parallel shortcutting of rooted trees. Journal of Algorithms, 23:139-159, 1997.
286. P. M. Vaidya. Minimum spanning trees in fc-dimensional space. SIAM Journal on Com-puting, 17:572-582, 1988.
287. P. M. Vaidya. An O (n log n) algorithm for the all-nearest-neighbors problem. Discrete & Computational Geometry, 4:101-115, 1989.
288. P. M. Vaidya. A sparse graph almost as good as the complete graph on points in K dimensions. Discrete & Computational Geometry, 6:369-381, 1991.
289. J. H. Van Lint and R. M. Wilson. A Course in Combinatorics. Cambridge University Press, Cambridge, UK, 1992.
290. K. R. Varadarajan. A divide-and-conquer algorithm for min-cost perfect matching in the plane. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, pages 320-329, 1998.
291. D. E. Willard. Predicate-oriented database search algorithms. Ph.D. thesis, Harvard Computation Laboratory, Harvard University, Cambridge, MA, 1978. Report TR-20-78.
292. D. E. Willard. The super-fc-tree algorithm. Report TR-03-79, Harvard Computation Laboratory, Harvard University, Cambridge, MA, 1979.
293. D. E. Willard and G. S. Lueker. Adding range restriction capability to dynamic data structures. Journal of the ACM, 32:597-617, 1985.
294. A. C. Yao. On constructing minimum spanning trees in fc-dimensional spaces and related problems. SIAM Journal on Computing, 11:721-736, 1982a.
295. A. C. Yao. Lower bounds for algebraic com-putation trees with integer inputs. SIAM Journal on Computing, 20:655-668, 1991.
296. A. C. Yao. Probabilistic computation: Towards a unified measure of complexity. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 222-227, 1977.
297. A. C. Yao. Space-time trade-off for answering range queries. In Proceedings of the 14th ACM Symposium on the Theory of Computing, pages 128-136, 1982b.
298. N. R. Zeh. I/O-Efficient Algorithms for Shortest Path Related Problems. Ph.D. thesis, School of Computer Science, Carleton University, Ottawa, Canada, 2002.