The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Real-time routing with OpenStreetMap data
Abstract
Routing services on the web and on hand-held devices have become ubiquitous in the past couple of years. Websites like Bing or Google Maps allow users to find routes between arbitrary locations comfortably in no time. Likewise onboard navigation units belong to the off-the-shelf equipment of virtually any new car.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
DOUGLAS, D. H., & PEUCKER, T. K. (1973) · Cartographica · doi:10.3138/fm57-6770-u75u-7727 · Cited by 4,229
Computing the shortest path: A search meets graph theory
Goldberg, A. V., & Harrelson, C. (2005) · doi:10.5555/1070432.1070455 · Cited by 719
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Geisberger, R., Sanders, P., Schultes, D., & Delling, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68552-4_24 · Cited by 714
Engineering Route Planning Algorithms
Delling, D., Sanders, P., Schultes, D., & Wagner, D. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02094-0_7 · Cited by 454
Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
(2004) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898715583 · Cited by 279
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., & Wagner, D. (2010) · ACM Journal of Experimental Algorithmics · doi:10.1145/1671970.1671976 · Cited by 190
Computing Many-to-Many Shortest Paths Using Highway Hierarchies
Knopp, S., Sanders, P., Schultes, D., Schulz, F., & Wagner, D. (2007) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972870.4 · Cited by 95
Acceleration of Shortest Path and Constrained Shortest Path Computation
Köhler, E., Möhring, R. H., & Schilling, H. (2005) · Lecture notes in computer science · doi:10.1007/11427186_13 · Cited by 92
Efficient Routing in Road Networks with Turn Costs
Geisberger, R., & Vetter, C. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20662-7_9 · Cited by 48
Self-citationDistributed Time-Dependent Contraction Hierarchies
Kieritz, T., Luxen, D., Sanders, P., et al. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13193-6_8 · Cited by 46
Self-citation
Cited by
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
End-to-End Learning of Driving Models with Surround-View Cameras and Route Planners
Hecker, S., Dai, D., & Van Gool, L. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01234-2_27 · Cited by 191
Zanin, M., & Wandelt, S. (2023) · Journal of the Air Transport Research Society · doi:10.59521/5e2ddec9fad4593b · Cited by 18
Willwerth, H. S., Khaemba, C. N., Serra, T., Michelson, H. C., Rutsaert, P., & Donovan, J. (2025) · Food Policy · doi:10.1016/j.foodpol.2025.102889 · Cited by 7
Metadata
- Authors
- Luxen, D., & Vetter, C.
- Venue
- Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
- Publisher
- ACM
- Published
- 2011-11
- Pages
- 513-516
- OpenAlex
- W2032865436
- Cited by
- 478
- References
- 11
- FWCI
- 22.83
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Real-time routing with OpenStreetMap data. https://app.cochat.ai/papers/10.1145/2093973.2094062
- The paper
- Luxen, D., & Vetter, C. (2011). Real-time routing with OpenStreetMap data. Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. https://doi.org/10.1145/2093973.2094062
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.