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

Authors:
Rolf Klein;Christian Knauer;Giri Narasimhan;Michiel Smid
Affiliations:
Institute of Computer Science I, Universität Bonn, Bonn, Germany;Institute of Computer Science, Freie Universität Berlin, Berlin, Germany;School of Computer Science, Florida, International University, Miami, FL;School of Computer Science, Carleton University, Ottawa, Ontario, Canada
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 9
Cited 0

Fast algorithms for shortest paths in planar graphs, with applications

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Approximating the Stretch Factor of Euclidean Graphs

SIAM Journal on Computing
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Finding the best shortcut in a geometric network

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Geometric Spanner Networks

Geometric Spanner Networks
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D

Discrete & Computational Geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G be a graph embedded in Euclidean space. For any two vertices of G their dilation denotes the length of a shortest connecting path in G, divided by their Euclidean distance. In this paper we study the spectrum of the dilation, over all pairs of vertices of G. For paths, trees, and cycles in 2D we present O(n3/2+ε) randomized algorithms that compute, for a given value κ ≥ 1, the exact number of vertex pairs of dilation κ. Then we present deterministic algorithms that approximate the number of vertex pairs of dilation κ up to an 1+η factor. They run in time O(n log2n) for chains and cycles, and in time O(n log3n) for trees, in any constant dimension.