Skip to main content
SpringerLink
Log in

Approximate Distance Oracles Revisited

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2518))

Included in the following conference series:

Abstract

Let G be a geometric t-spanner in Ed with n vertices and m edges, where t is a constant. We show that G can be preprocessed in O(m log n) time, such that (1 + ε)-approximate shortest-path queries in G can be answered in O(1) time. The data structure uses O(n log n) space.

J.G. is supported by The Swedish Foundation for International Cooperation in Research and Higher Education and M.S. is supported by NSERC.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28:1167–1181, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Alstrup and J. Holm, Improved algorithms for finding level ancestors in dynamic trees. In Proc. 27th International Colloquium on Automata, Languages, and Programming, 2000.

    Google Scholar 

  3. S. Arikati, D. Z. Chen, L. P. Chew, G. Das, M. Smid, and C. D. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In Proc. 4th European Symposium on Algorithms, LNCS 1136, pp. 514–528, 1996.

    Google Scholar 

  4. D.Z. Chen. On the all-pairs Euclidean short path problem. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 292–301, 1995.

    Google Scholar 

  5. D. Z. Chen, K. S. Klenk, and H.-Y. T. Tu. Shortest path queries among weighted obstacles in the rectilinear plane. SIAM Journal on Computing, 29:1223–1246, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  6. Y.-J. Chiang and J. S. B. Mitchell. Two-point Euclidean shortest path queries in the plane. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.

    Google Scholar 

  7. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing, 28:210–236, 1998.

    Article  MATH  Google Scholar 

  8. D. Dor, S. Halperin, and U. Zwick. All-pairs almost shortest paths. SIAM Journal on Computing, 29:1740–1759, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Gudmundsson, C. Levcopoulos, G. Narasimhan and M. Smid. Approximate Distance Oracles for Geometric graphs. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.

    Google Scholar 

  10. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13:338–355, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. B. Kruskal, Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7(1956):48–50, 1956.

    Article  MathSciNet  Google Scholar 

  12. D. Krznaric, C. Levcopoulos and B. J. Nilsson. Minimum Spanning Trees in d Dimensions. Nordic Journal of Computing, 6(4):446–461, 1999.

    MATH  MathSciNet  Google Scholar 

  13. J. S. B. Mitchell. Shortest paths and networks. In Handbook of Discrete and Computational Geometry, pp. 445–466. CRC Press LLC, 1997.

    Google Scholar 

  14. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. 33rd ACM Symposium on Theory of Computing, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands

    Joachim Gudmundsson

  2. Department of Computer Science, Lund University, Box 118, 221 00, Lund, Sweden

    Christos Levcopoulos

  3. School of Computer Science, Florida International University, Miami, FL, 33199, USA

    Giri Narasimhan

  4. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Michiel Smid

Authors
  1. Joachim Gudmundsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos Levcopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giri Narasimhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michiel Smid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M. (2002). Approximate Distance Oracles Revisited. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation