Experimental study of geometric t-spanners

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 556-567

  Farshi, Mohammad ^a   Gudmundsson, Joachim ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; MEASUREMENT THEORY; NUMBER THEORY;

GEOMETRIC T-SPANNERS; POINT SETS; T-SPANNER ALGORITHMS;

SET THEORY;

EID: 27144469503     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_50     Document Type: Conference Paper

References (20)

1. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81-100, 1993.
2. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. 27th ACM Symposium on Theory of Computing, pages 489-498, 1995.
3. P. Bose, J. Gudmundsson, and P. Morin. Ordered theta graphs. Computational Geometry: Theory and Applications, 28:11-18, 2004.
4. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM, 42:67-90, 1995.
5. K. L. Clarkson. Approximation algorithms for shortest path motion planning. In Proc. 19th ACM Symposium on Computational Geometry, pages 56-65, 1987.
6. A. Czumaj and A. Lingas. Fast approximation schemes for Euclidean multi-connectivity problems. In Proc. 27th International Colloquium on Automata, Languages and Programming, volume 1853 of Lecture Notes in Computer Science, pages 856-868. Springer-Verlag, 2000.
7. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier Science Publishers, Amsterdam, 2000.
8. A. M. Farley, A. Proskurowski, D. Zappala, and K. J. Windisch. Spanners and message distribution in networks. Discrete Applied Mathematics, 137(2): 159-171, 2004.
9. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric spanners. SIAM Journal of Computing, 31(5):1479-1500, 2002.
10. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric graph. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.
11. J. M. Keil. Approximating the complete Euclidean graph. In Proc. 1st Scandinavian Workshop on Algorithmic Theory, pages 208-213, 1988.
12. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete and Computational Geometry, 7:13-28, 1992.
13. X.-Y. Li. Applications of computational geomety in wireless ad hoc networks. In X.-Z. Cheng, X. Huang, and D.-Z. Du, editors, Ad Hoc Wireless Networking. Kluwer, 2003.
14. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK, 2000.
15. G. Navarro and R. Paredes. Practical construction of metric t-spanners. In Proc. 5th Workshop on Algorithm Engineering and Experiments, pages 69-81. SIAM Press, 2003.
16. G. Navarro, R. Paredes, and E. Chvez. t-spanners as a data structure for metric space searching. In Proc. 9th International Symposium on String Processing and Information Retrieval, volume 2476 of Lecture Notes in Computer Science, pages 298-309. Springer-Verlag, 2002.
17. Helen C. Purchase. Which aesthetic has the greatest effect on human understanding? In Graph Drawing, volume 1353 of Lecture Notes in Computer Science, pages 248-261. Springer-Verlag, 1997.
18. S. Rao and W. D. Smith. Approximating geometrical graphs via spanners and banyans. In Proc. 30th ACM Symposium on the Theory of Computing, pages 540-550. ACM, 1998.
19. J. Ruppert and R. Seidel. Approximating the d-dimensional complete Euclidean graph. In Proc. 3rd Canadian Conference on Computational Geometry, pages 207-210, 1991.
20. M. Sigurd and M. Zachariasen. Construction of minimum-weight spanners. In Proc. 12th European Symposium on Algorithms, number 3221 in Lecture Notes in Computer Science. Springer-Verlag, 2004.