Aarhus University Seal

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

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearch

  • 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 languageEnglish
JournalElectronic Colloquium on Computational Complexity
Number of pages12
Publication statusPublished - 2001

    Research areas

  • Timetable, time-dependent network, shortest path, traveler information system, modeling, algorithm

See relations at Aarhus University Citationformats

ID: 280795