1 Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University2 Department of Computer Science, Science and Technology, Aarhus University3 Schweiz, Institute of Theoretical Computer Science, ETH, Zürich4 Department of Computer Science, Science and Technology, Aarhus University
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.
Electronic Colloquium on Computational Complexity, 2001, Vol 92, Issue ALCOMFT-TR-01-176
Timetable; time-dependent network; shortest path; traveler information system; modeling; algorithm