Skip to main content
SpringerLink
Log in

Routing in Road Networks with Transit Nodes

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 72 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. 9th DIMACS implementation challenge: shortest paths (2006). http://www.dis.uniroma1.it/~challenge9/

  2. Bast H, Funke S, Matijevic D, Sanders P, Schultes D (2007) In transit to constant time shortest-path queries in road networks. In: Workshop on algorithm engineering and experiments, pp 46–59

    Google Scholar 

  3. Bast H, Funke S, Sanders P, Schultes D (2007) Fast routing in road networks with transit nodes. Science 316(5824):566

    Article  MathSciNet  MATH  Google Scholar 

  4. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271

    Article  MathSciNet  MATH  Google Scholar 

  5. Sanders P, Schultes D (2005) Highway hierarchies hasten exact shortest path queries. In: 13th European symposium on algorithms. LNCS, vol 3669. Springer, Berlin, pp 568–579

    Google Scholar 

  6. Sanders P, Schultes D (2006) Engineering highway hierarchies. In: 14th European symposium on algorithms. LNCS, vol 4168. Springer, Berlin, pp 804–816

    Google Scholar 

  7. Sanders P, Schultes D (2007) Engineering fast route planning algorithms. In: 6th workshop on experimental algorithms. LNCS, vol 4525. Springer, Berlin, pp 23–36

    Google Scholar 

  8. Schultes D, Sanders P (2007) Dynamic highway-node routing. In: 6th workshop on experimental algorithms. LNCS, vol 4525. Springer, Berlin, pp 66–79

    Google Scholar 

  9. U.S. Census Bureau, Washington, DC (2002) UA census 2000 TIGER/line files. http://www.census.gov/geo/www/tiger/tigerua/ua_tgr2k.html

Download references

Author information

Authors and Affiliations

  1. Institute for Computer Science, University of Karlsruhe, Karlsruhe, Germany

    Dominik Schultes

Authors
  1. Dominik Schultes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dominik Schultes .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Schultes, D. (2016). Routing in Road Networks with Transit Nodes. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_353

Download citation

Publish with us

Policies and ethics

Search

Navigation