7 citations · 11 across the 3 of their papers we have counts for
3 papers · 1 filter
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…
Zeros and approximations of Holant polynomials on the complex plane
Katrin Casel, Philipp Fischbeck, Tobias Friedrich +2
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into…
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…