Vertex Disjoint Paths for Dispatching in Railways

12 years 8 months ago
Vertex Disjoint Paths for Dispatching in Railways
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 routingin-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. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems—Routing and layout, G.2.2 Graph Theory—Path and circuit problems, G.2.3 Applications Keywords and phrases algorithms, approximation, complexity, graph theory, railways, routing, transportation Digital Object Identifier 10.4230/OASIcs.ATMOS.2010.61
Holger Flier, Matús Mihalák, Anita S
Added 12 Jan 2011
Updated 12 Jan 2011
Type Journal
Year 2010
Authors Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych
Comments (0)