On spanners of geometric graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4059 LNCS, Issue , 2006, Pages 388-399

  Gudmundsson, Joachim ^a   Smid, Michiel ^b  

^a CSIRO   (Australia)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; PROBLEM SOLVING;

CONNECTED WEIGHTED GRAPH; GEOMETRIC GRAPHS; T-SPANNER;

GRAPH THEORY;

EID: 33746430071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_36     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:81-100, 1993.
2. S. Baswana and S. Sen. A simple linear time algorithm for computing a (2k - 1)-spanner of O(n1+1/k) size in weighted graphs. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 384-396, Berlin, 2003. Springer-Verlag.
3. U. Brandes and D. Handke. NP-completeness results for minimum planar spanners. Discrete Mathematics and Theoretical Computer Science, 3:1-10, 1998.
4. L. Cai. NP-completeness of minimum spanner problems. Discrete Applied Mathematics, 48:187-194, 1994.
5. L. Cai and D. Cornell. Tree spanners. SIAM Journal on Discrete Mathematics, 8:359-387, 1995.
6. P. B. Callahan and S. R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pages 291-300, 1993.
7. L. S. Chandran. A high girth graph construction. SIAM Journal on Discrete Mathematics, 16:366-370, 2003.
8. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier Science, Amsterdam, 2000.
9. J. Gudmundsson and C. Knauer. Dilation and detours in geometric networks. In T. F. Gonzalez, editor, Handbook on Approximation Algorithms and Metaheuristics. Chapman & Hall/CRC, Boca Raton, 2006.
10. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric graphs. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pages 828-837, 2002.
11. J. Gudmundsson, G. Narasimhan, and M. Smid. Fast pruning of geometric spanners. In Proceedings 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.
12. F. Lazebnik and V.A. Ustimenko. Explicit construction of graphs with an arbitrary large girth and of large size. Discrete Applied Mathematics, 60:275-284, 1995.
13. M. Mitzenmacher and E. Upfal. Probability and Computing. Cambridge University Press, Cambridge, UK, 2005.
14. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, 2000.
15. D. Peleg and A. A. Schäffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
16. L. Roditty, M. Thorup, and U. Zwick. Deterministic constructions of approximate distance oracles and spanners. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, volume 3580 of Lecture Notes in Computer Science, pages 261-272, Berlin, 2005. Springer-Verlag.
17. J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry & Applications, 1:99-107, 1991.
18. 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.
19. 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.
20. G. Venkatesan, U. Rotics, M.S. Madanlal, J.A. Makowsky, and C. Pandu Rangan. Restrictions of minimum spanner problems. Information and Computation, 136:143-164, 1997.