Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries

Gerth Stølting Brodal and Riko Jacob

In Proc. Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003), volume 92(1) of Electronic Notes in Theoretical Computer Science, 12 pages. Elsevier Science, 2003.

Abstract

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.

Copyright notice

Copyright © 2003 by Elsevier Inc.. All rights reserved.

Online version

atmos03.pdf (164 Kb)

DOI

10.1016/j.entcs.2003.12.019

BIBTEX entry

@incollection{atmos03,
  author = "Gerth St{\o}lting Brodal and Riko Jacob",
  booktitle = "Proc. Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003)",
  doi = "10.1016/j.entcs.2003.12.019",
  issn = "1571-0661",
  number = "1",
  pages = "12",
  publisher = "Elsevier Science",
  series = "Electronic Notes in Theoretical Computer Science",
  title = "Time-Dependent Networks as Models to Achieve Fast Exact Time-Table Queries",
  volume = "92",
  year = "2003"
}

Other versions