Computing and Listing st-Paths in Public Transportation Networks

Katerina Böhmová, Luca Häfliger, Matúš Mihalák, Tobias Pröger*, Gustavo Sacomoto, Marie-France Sagot

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


Given a set of directed paths (called lines) L, a public transportation network is a directed graph G (L) = (V (L) , A (L) ) which contains exactly the vertices and arcs of every line l a L. An st-route is a pair (pi, gamma) where gamma = aOE (c) l (1),aEuro broken vertical bar, l (h) > is a line sequence and pi is an st-path in G (L) which is the concatenation of subpaths of the lines l (1),aEuro broken vertical bar, l (h) , in this order. Given a threshold beta, we present an algorithm for listing all st-paths pi for which a route (pi, gamma) with |gamma| ae beta exists, and we show that the running time of this algorithm is polynomial with respect to the input and the output size. We also present an algorithm for listing all line sequences gamma with |gamma| ae beta for which a route (pi, gamma) exists, and show how to speed it up using preprocessing. Moreover, we show that for the problem of finding an st-route (pi, gamma) that minimizes the number of different lines in gamma, even computing an -approximation is NP-hard.

Original languageEnglish
Pages (from-to)600-621
Number of pages22
JournalTheory of Computing Systems
Issue number3
Publication statusPublished - 1 Apr 2018


  • Listing algorithm
  • NP-hardness
  • Public transportation

Cite this