2026-07-20T11:46:00Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1582 2024-03-06T10:28:32Z ddc:004 open_access

Engineering Time-Expanded Graphs for Faster Timetable Information Delling, Daniel Pajor, Thomas Wagner, Dorothea Timetable information shortest path modeling 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Daniel Delling and Thomas Pajor and Dorothea Wagner 2008 Is Part Of OASIcs, Volume 9, 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08) (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2008.1582 urn:nbn:de:0030-drops-15826 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2008.1582 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode