Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces

  • Jun Luo
  • Christian Wulff-Nilsen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5369)

Abstract

Given a graph embedded in a metric space, its dilation is the maximum over all distinct pairs of vertices of the ratio between their distance in the graph and the metric distance between them. Given such a graph G with n vertices and m edges and consisting of at most two connected components, we consider the problem of augmenting G with an edge such that the resulting graph has minimum dilation. We show that we can find such an edge in \(O((n^4\log n)/\sqrt m)\) time using linear space which solves an open problem of whether a linear-space algorithm with o(n4) running time exists. We show that O(n2logn) time is achievable if G is a simple path or the union of two vertex-disjoint simple paths. Finally, we show how to find an edge that maximizes the dilation of the resulting graph in O(n3) time with O(n2) space and in O(n3logn) time with linear space.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahn, H.-K., Farshi, M., Knauer, C., Smid, M., Wang, Y.: Dilation-optimal edge deletion in polygonal cycles. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 88–99. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 590–598 (2007)Google Scholar
  3. 3.
    Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425–461. Elsevier Science Publishers, Amsterdam (2000)CrossRefGoogle Scholar
  4. 4.
    Farshi, M., Giannopoulos, P., Gudmundsson, J.: Finding the Best Shortcut in a Geometric Network. In: 21st Ann. ACM Symp. Comput. Geom., pp. 327–335 (2005)Google Scholar
  5. 5.
    Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)CrossRefMATHGoogle Scholar
  6. 6.
    Smid, M.: Closest point problems in computational geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 877–935. Elsevier Science Publishers, Amsterdam (2000)CrossRefGoogle Scholar
  7. 7.
    Wulff-Nilsen, C.: Computing the Dilation of Edge-Augmented Graphs in Metric Spaces. In: 24th European Workshop on Computational Geometry, Nancy, pp. 123–126 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jun Luo
    • 1
  • Christian Wulff-Nilsen
    • 2
  1. 1.Department of Information and Computing SciencesUniversiteit Utrecht, Centrumgebouw NoordUtrechtThe Netherlands
  2. 2.Department of Computer ScienceUniversity of CopenhagenCopenhagen ODenmark

Personalised recommendations