3 papers
cs.DS2020
A Strategic Routing Framework and Algorithms for Computing Alternative Paths
Thomas Bläsius, Maximilian Böther, Philipp Fischbeck +9
Traditional navigation services find the fastest route for a single driver. Though always using the fastest route seems desirable for every individual, selfish behavior can have un…
cs.SI2019
Understanding the Effectiveness of Data Reduction in Public Transportation Networks
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich +1
Given a public transportation network of stations and connections, we want to find a minimum subset of stations such that each connection runs through a selected station. Although…
cs.DS2019
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich +1
The VertexCover problem is proven to be computationally hard in different ways: It is NP-complete to find an optimal solution and even NP-hard to find an approximation with reasona…