Vertex Disjoint Paths for Dispatching in Railways

Authors Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych

Thumbnail PDF


  • Filesize: 0.54 MB
  • 13 pages

Document Identifiers

Author Details

Holger Flier
Matús Mihalák
Anita Schöbel
Peter Widmayer
Anna Zych

Cite AsGet BibTex

Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, and Anna Zych. Vertex Disjoint Paths for Dispatching in Railways. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 61-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization, and routing-in-rounds problem. Although all considered variants are NP-hard in planar graphs, restrictions on the location of the terminals, motivated by railway applications, lead to polynomially solvable cases for the decision and maximization versions of the problem, and to a $p$-approximation algorithm for the routing-in-rounds problem, where $p$ is the maximum number of alternative paths for a terminal pair.
  • algorithms
  • approximation
  • complexity
  • graph theory
  • railways
  • routing
  • transportation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail