Skip to main content
SpringerLink
Log in

Distance Oracles for Time-Dependent Networks

  • Conference paper
Automata, Languages, and Programming (ICALP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8572))

Included in the following conference series:

Abstract

We present the first approximate distance oracle for sparse directed networks with time-dependent arc-travel-times determined by continuous, piecewise linear, positive functions possessing the FIFO property. Our approach precomputes (1 + ε) −approximate distance summaries from selected landmark vertices to all other vertices in the network, and provides two sublinear-time query algorithms that deliver constant and (1 + σ) −approximate shortest-travel-times, respectively, for arbitrary origin-destination pairs in the network. Our oracle is based only on the sparsity of the network, along with two quite natural assumptions about travel-time functions which allow the smooth transition towards asymmetric and time-dependent distance metrics.

Full version available at [14]. This work was supported by EU FP7/2007-2013 under grant agreements no. 288094 (eCOMPASS) and no. 609026 (MOVESMART), and partially done while both authors were visiting the Karlsruhe Inst. of Technology.

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. Agarwal, R.: The space-stretch-time trade-off in distance oracles (July 2013) (manuscript)

    Google Scholar 

  2. Agarwal, R., Godfrey, P.: Distance oracles for stretch less than 2. In: Proceedings of the 24th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 526–538. ACM-SIAM (2013)

    Google Scholar 

  3. Batz, G.V., Geisberger, R., Sanders, P., Vetter, C.: Minimum time-dependent travel times with contraction hierarchies. ACM Journal of Experimental Algorithmics 18 (2013)

    Google Scholar 

  4. Cooke, K., Halsey, E.: The shortest route through a network with time-dependent intermodal transit times. Journal of Mathematical Analysis and Applications 14(3), 493–498 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dean, B.C.: Continuous-time dynamic shortest path algorithms. Master’s thesis, Massachusetts Institute of Technology (1999)

    Google Scholar 

  6. Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 44(1), 41–46 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dean, B.C.: Shortest paths in fifo time-dependent networks: Theory and algorithms. Technical report, MIT (2004)

    Google Scholar 

  8. Dehne, F., Masoud, O.T., Sack, J.-R.: Shortest paths in time-dependent fifo networks. Algorithmica 62(1-2), 416–435 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  9. Delling, D.: Time-Dependent SHARC-Routing. Algorithmica 60(1), 60–94 (2011); Special Issue: European Symposium on Algorithms (2008)

    Google Scholar 

  10. Delling, D., Wagner, D.: Time-Dependent Route Planning. In: Ahuja, R.K., Möhring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 207–230. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research 17(3), 395–412 (1969)

    Article  MATH  Google Scholar 

  12. eCOMPASS Project (2011-2014), http://www.ecompass-project.eu

  13. Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. Algorithmica 68(4), 1075–1097 (2011); Preliminary version in ACM-SIAM SODA (2011)

    Google Scholar 

  14. Kontogiannis, S., Zaroliagis, C.: Distance oracles for time dependent networks. eCOMPASS Technical Report (eCOMPASS-TR-025) / ArXiv Report (arXiv.org > cs > arXiv:1309.4973) (September 2013)

    Google Scholar 

  15. Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* Search on Time-Dependent Road Networks. Networks 59, 240–251 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  16. Orda, A., Rom, R.: Shortest-path and minimum delay algorithms in networks with time-dependent edge-length. Journal of the ACM 37(3), 607–625 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  17. Patrascu, M., Roditty, L.: Distance oracles beyond the Thorup–Zwick bound. In: Proc. of 51th IEEE Symp. on Found. of Comp. Sci. (FOCS 2010), pp. 815–823 (2010)

    Google Scholar 

  18. Porat, E., Roditty, L.: Preprocess, set, query! In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 603–614. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  19. Sherali, H.D., Ozbay, K., Subramanian, S.: The time-dependent shortest pair of disjoint paths problem: Complexity, Models, and Algorithms. Networks 31(4), 259–272 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sommer, C.: Shortest-path queries in static networks. ACM Computing Surveys 46 (2014)

    Google Scholar 

  21. Sommer, C., Verbin, E., Yu, W.: Distance oracles for sparse graphs. In: Proc. of 50th IEEE Symp. on Found. of Comp. Sci. (FOCS 2009), pp. 703–712 (2009)

    Google Scholar 

  22. Thorup, M., Zwick, U.: Approximate distance oracles. J. of ACM 52, 1–24 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  23. Wulff-Nilsen, C.: Approximate distance oracles with improved preprocessing time. In: Proc. of 23rd ACM-SIAM Symp. on Discr. Alg. (SODA 2012) (2012)

    Google Scholar 

  24. Wulff-Nilsen, C.: Approximate distance oracles with improved query time. arXiv abs/1202.2336 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Comp. Science & Engineering, U. Ioannina, 45110, Ioannina, Greece

    Spyros Kontogiannis

  2. Computer Technology Institute & Press “Diophantus”, 26504, Patras, Greece

    Spyros Kontogiannis & Christos Zaroliagis

  3. Dept. of Comp. Engineering & Informatics, U. Patras, 26504, Patras, Greece

    Christos Zaroliagis

Authors
  1. Spyros Kontogiannis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos Zaroliagis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, Boltzmannstrasse 3, 85748, München, Germany

    Javier Esparza

  2. LIAFA, Université Paris Diderot-Paris 7, Case 7014, 75205, Paris Cedex 13, France

    Pierre Fraigniaud

  3. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Thore Husfeldt

  4. Department Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Elias Koutsoupias

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kontogiannis, S., Zaroliagis, C. (2014). Distance Oracles for Time-Dependent Networks. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43948-7_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43948-7_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43947-0

  • Online ISBN: 978-3-662-43948-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation