"Robust, Almost Constant Time Shortest-Path Queries in Road Networks."

Peter Sanders, Dominik Schultes (2006)

> Home

Details and statistics

DOI: 10.1090/DIMACS/074/08

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-09

- view
  - electronic edition via DOI (archived)
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dimacs/SandersS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dimacs/SandersS06
Peter Sanders, Dominik Schultes:
Robust, Almost Constant Time Shortest-Path Queries in Road Networks. The Shortest Path Problem 2006: 193-218

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.