Computing the maximum detour and spanning ratio of planar paths, trees, and cycles

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

Volumn 2285, Issue , 2002, Pages 250-261

  Langerman, Stefan ^a   Morin, Pat ^a   Soss, Michael ^b  

^a MCGILL UNIVERSITY   (Canada)

^b INSTITUTE FOR RESEARCH IN IMMUNOLOGY AND CANCER   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EMBEDDED GRAPHS; EUCLIDEAN GRAPH; EUCLIDEAN SPACES; PLANAR TREE; POLYGONAL PATH; TIME ALGORITHMS;

FORESTRY;

ALGORITHMS; PROBLEM SOLVING; TREES;

EID: 84866282104     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_20     Document Type: Conference Paper

References (10)

1. P. K. Agarwal, R. Klein, C. Knauer, and M. Sharir. Computing the detour of polygonal curves. Unpublished Manuscript, November 2001.
2. J. L. Bentley and J. B. Saxe. Decomposable searching problems. I. Static-to-dynamic transformation. Journal of Algorithms, 1(4):301–358, 1980.
3. P. Bose and P. Morin. Competitive online routing in geometric graphs. In Proceedings of the VIII International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), 2001.
4. T. M. Chan. Geometric applications of a randomized optimization technique. Discrete & Computational Geometry, 22(4):547–567, 1999.
5. 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 Annual European Symposium on Algorithms (ESA 2001), pages 321–332, 2001.
6. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425–461. Elsevier, 1999.
7. S. J. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153–174, 1987.
8. C. Icking and R. Klein. Searching for the kernel of a polygon: A competitive strategy. In Proceedings of the 11th Annual Symposium on Computational Geometry, pages 258–266, 1995.
9. W. A. Johnson and R. F. Mehl. Reaction kinetics in processes of nucleation and growth. Transactions of the Americal Institute of Mining and Metallurgy, 135:416–458, 1939.
10. 10. G. Narasimhan and M. Smid. Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing, 30(3):978–989, 2001.