Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries

Gerth Stølting Brodal, Riko Jacob · Electronic Notes in Theoretical Computer Science · 2004

We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries for travelers using a train system. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models.

Read the paper · More papers on PaperTik