You are here:
» Time-dependent Networks as Models to Achieve Fast Exact T...
About Aarhus University
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries
Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research
- Gerth Stølting Brodal
- Rico Jacob, Schweiz, Institute of Theoretical Computer Science, ETH, Zürich, Switzerland
- Department of Computer Science
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.
| Original language | English |
|---|---|
| Journal | Electronic Colloquium on Computational Complexity |
| Volume | 92 |
| Issue | ALCOMFT-TR-01-176 |
| Number of pages | 12 |
| ISSN | 1433-8092 |
| Publication status | Published - 2001 |
- Timetable, time-dependent network, shortest path, traveler information system, modeling, algorithm
Research areas
See relations at Aarhus University Citationformats
ID: 280795