2652??“2661.
7. Sunil Arya, Gautam Das, David Mount, Je?®rey Salowe, and Michiel Smid,
???Euclidean spanners: short, thin, and lanky,??? in Proc. 27th ACM STOC, 1995,
pp. 489??“498.
8. Sunil Arya and Michiel Smid, ???E?±cient construction of a bounded degree
spanner with low weight,??? in Proc. 2nd Annu. European Sympos. Algorithms
(ESA), volume 855 of Lecture Notes in Computer Science, 1994, pp. 48??“59.
9. Prosenjit Bose, Luc Devroye, William Evans, and David Kirkpatrick, ???On the
spanning ratio of Gabriel graphs and Beta-skeletons,??? in Proceedings of the
Latin American Theoretical Infocomatics (LATIN), 2002.
10. Barun Chandra, Gautam Das, Giri Narasimhan, and Jose Soares, ???New sparseness
results on graph spanners,??? in Proc. 8th Annual ACM Symposium on
Computational Geometry, 1992, pp. 192??“201.
11. Menelaos I. Karavelas and Leonidas J. Guibas, ???Static and kinetic geometric
spanners with applications,??? in Proceeding of the Twelfth Annual Symposium
on Discrete algorithms, 2001, pp. 168??“176.
12. Christos Levcopoulos, Giri Narasimhan, and Michiel Smid, ???E?±cient algorithms
for constructing fault-tolerant geometric spanners,??? in Proceedings of
the thirtieth annual ACM symposium on Theory of computing, 1998.
13. Andrew C.-C. Yao, ???On constructing minimum spanning trees in k-dimensional
spaces and related problems,??? SIAM J. Computing, vol. 11, pp. 721??“736, 1982.
14. Brad Karp and H.
Pages:
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249