OASIcs.ATMOS.2008.1582.pdf
- Filesize: 216 kB
- 20 pages
Document
Engineering Time-Expanded Graphs for Faster Timetable Information
Authors
-
Part of:
Volume:
8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08) (ATMOS 2008)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2008-09-24
Cite As Get BibTex
Daniel Delling, Thomas Pajor, and Dorothea Wagner. Engineering Time-Expanded Graphs for Faster Timetable Information. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08). Open Access Series in Informatics (OASIcs), Volume 9, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/OASIcs.ATMOS.2008.1582
Abstract
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less space consumption than the original model. Moreover, we show that our extensions harmonize well with speed-up techniques whose adaption to timetable networks is more challenging than one might expect.
Subject Classification
Keywords
- Timetable information
- shortest path
- modeling
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads