1 citations · 1 across the 1 of their papers we have counts for
3 papers
Error Bounds for Discrete-Continuous Shortest Path Problems with Application to Free Flight Trajectory Optimization
Ralf Borndörfer, Fabian Danecker, Martin Weiser
Two-stage methods addressing continuous shortest path problems start local minimization from discrete shortest paths in a spatial graph. The convergence of such hybrid methods to g…
The Price of Symmetric Line Plans in the Parametric City
Berenike Masing, Niels Lindner, Ralf Borndörfer
We consider the line planning problem in public transport in the Parametric City, an idealized model that captures typical scenarios by a (small) number of parameters. The Parametr…
Connected -partition of -connected graphs and -claw-free graphs
Ralf Borndörfer, Katrin Casel, Davis Issac +3
A connected partition is a partition of the vertices of a graph into sets that induce connected subgraphs. Such partitions naturally occur in many application areas such as road ne…