Abstract
Let G be a geometric graph whose vertex set S is a set of n points in ℝd. The stretch factor of two distinct points p and q in S is the ratio of their shortest-path distance in G and their Euclidean distance. We consider the problem of approximating the sum of all \(n \choose 2\) stretch factors determined by all pairs of points in S. We show that for paths, cycles, and trees, this sum can be approximated, within a factor of 1 + ε, in O(n polylog(n)) time. For plane graphs, we present a (2 + ε)-approximation algorithm with running time O(n 5/3 polylog(n)), and a (4 + ε)-approximation algorithm with running time O(n 3/2 polylog(n)).
Research of Cheng was supported by Research Grant Council, Hong Kong, China (project no. 612107). Research of Smid was supported by NSERC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Klein, R., Knauer, C., Langerman, S., Morin, P., Sharir, M., Soss, M.: Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D. Discrete & Computational Geometry 39, 17–37 (2008)
Arikati, S., Chen, D.Z., Chew, L.P., Das, G., Smid, M., Zaroliagis, C.D.: Planar spanners and approximate shortest path queries among obstacles in the plane. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 514–528. Springer, Heidelberg (1996)
Callahan, P.B., Kosaraju, S.R.: 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)
Farshi, M., Giannopoulos, P., Gudmundsson, J.: Improving the stretch factor of a geometric graph by edge augmentation. SIAM Journal on Computing 38, 226–240 (2008)
Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing 16, 1004–1022 (1987)
Klein, R., Knauer, C., Narasimhan, G., Smid, M.: On the dilation spectrum of paths, cycles, and trees. Computational Geometry: Theory and Applications 42, 923–933 (2009)
Narasimhan, G., Smid, M.: Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing 30, 978–989 (2000)
Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)
Wulff-Nilsen, C.: Wiener index and diameter of a planar graph in subquadratic time. In: EuroCG, pp. 25–28 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, SW., Knauer, C., Langerman, S., Smid, M. (2010). Approximating the Average Stretch Factor of Geometric Graphs. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-17517-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17516-9
Online ISBN: 978-3-642-17517-6
eBook Packages: Computer ScienceComputer Science (R0)