10.4230/OASICS.ATMOS.2008.1582
Delling, Daniel
Daniel
Delling
Pajor, Thomas
Thomas
Pajor
Wagner, Dorothea
Dorothea
Wagner
Engineering Time-Expanded Graphs for Faster Timetable Information
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2008
Article
Timetable information
shortest path
modeling
Fischetti, Matteo
Matteo
Fischetti
Widmayer, Peter
Peter
Widmayer
2008
2008-09-24
2008-09-24
2008-09-24
en
urn:nbn:de:0030-drops-15826
10.4230/OASIcs.ATMOS.2008
978-3-939897-07-1
2190-6807
10.4230/OASIcs.ATMOS.2008
OASIcs, Volume 9, ATMOS 2008
8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)
2012
9
4
1
20
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Fischetti, Matteo
Matteo
Fischetti
Widmayer, Peter
Peter
Widmayer
2190-6807
Open Access Series in Informatics (OASIcs)
2008
9
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
20 pages
221449 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
OASIcs, Vol. 9, 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08), pages 1-20