Exact and approximation algorithms for computing the dilation spectrum of paths, trees, and cycles

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

Volumn 3827 LNCS, Issue , 2005, Pages 849-858

  Klein, Rolf ^a   Knauer, Christian ^b   Narasimhan, Giri ^c   Smid, Michiel ^d  

^a UNIVERSITY OF BONN   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c The Department of Electrical and Computer Engineering   (United States)

^d CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; NUMBER THEORY; SPECTRUM ANALYSIS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; DILATION SPECTRUM; EUCLIDEAN DISTANCE; VERTEX PAIRS;

ALGORITHMS;

EID: 33744960646     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_85     Document Type: Conference Paper

References (15)

1. P. AGARWAL, R. KLEIN, CH. KNAUER, S. LANGERMAN, P. MORIN, M. SHARIR, AND M. SOSS, Computing the detour and spanning ratio of paths, trees and cycles in 2D and 3D, to appear in Discrete and Computational Geometry.
2. P. AGARWAL, R. KLEIN, CH. KNAUER, AND M. SHARIR, Computing the detour of polygonal curves, Technical Report B 02-03, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 2002.
3. P. B. CALLAHAN AND S. R. KOSARAJU, A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields, J. ACM, 42 (1995), pp. 67-90.
4. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
5. D. EPPSTEIN, Spanning trees and spanners, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier Science, Amsterdam, 1999, pp. 425-461.
6. M. FARSHI, P. GIANNOPOULOS, AND J. GUDMUNDSSON, Finding the best shortcut in a geometric network, 21st Ann. ACM Symp. Comput. Geom. (2005), pp. 327-335.
7. G. N. FREDERICKSON, Fast algorithms for shortest paths in planar graphs, with applications, SIAM J. Comput., 16 (1987), pp. 1004-1022.
8. D. HAUSSLER AND E. WELZL, Epsilon-nets and simplex range queries, Discrete Comput. Geom. 2 (1987), pp. 127-151.
9. S. LANGERMAN, P. MORIN, AND M. SOSS, Computing the maximum detour and spanning ratio of planar chains, trees and cycles, In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science (STAGS 2002), volume 2285 of LNCS, pages 250-261. Springer-Verlag, 2002.
10. N. LINIAL, E. LONDON, AND Y. RABINOVICH, The geometry of graphs and some of its algorithmic applications, Combinatorica, 15 (1995), pp. 215-245.
11. G. NARASIMHAN AND M. SMID, Approximating the stretch factor of Euclidean Graphs, SIAM J. Comput., 30(3) (2000), pp. 978-989.
12. G. NARASIMHAN AND M. SMID, Geometric Spanner Networks, Cambridge University Press, to appear.
13. D. PELEG AND A. SCHÄFFER, Graph spanners, J. Graph Theory, 13 (1989), pp. 99-116.
14. M. SHARIR AND P. AGARWAL, Davenport-Schinzel sequences and their geometric applications, Cambridge University Press, New York, 1995.
15. M. SMID, Closest-point problems in computational geometry, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier Science, Amsterdam, 1999, pp. 877-935.