A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries
2004
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models.
doi:10.1016/j.entcs.2003.12.019
fatcat:7p443fdgirfx7alop5hgd26owq