1 citations · 1 across the 3 of their papers we have counts for
6 papers
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
Daniel Funke, Demian Hespe, Peter Sanders +2
In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or…
Customizable Hub Labeling: Properties and Algorithms
Johannes Blum, Sabine Storandt
Hub Labeling (HL) is one of the state-of-the-art preprocessing-based techniques for route planning in road networks. It is a special incarnation of distance labeling, and it is wel…
Polyline Simplification under the Local Fréchet Distance has Almost-Quadratic Runtime in 2D
Sabine Storandt, Johannes Zink
Given a polyline on vertices, the polyline simplification problem asks for a minimum size subsequence of these vertices defining a new polyline whose distance to the original p…
Consistent Simplification of Polyline Tree Bundles
Yannick Bosch, Peter Schäfer, Joachim Spoerhase +2
The Polyline Bundle Simplification (PBS) problem is a generalization of the classical polyline simplification problem. Given a set of polylines, which may share line segments and p…
Simplification of Polyline Bundles
Joachim Spoerhase, Sabine Storandt, Johannes Zink
We propose and study a generalization to the well-known problem of polyline simplification. Instead of a single polyline, we are given a set of polylines possibly sharing so…
Efficient Generation of Geographically Accurate Transit Maps
Hannah Bast, Patrick Brosi, Sabine Storandt
We present LOOM (Line-Ordering Optimized Maps), a fully automatic generator of geographically accurate transit maps. The input to LOOM is data about the lines of a given transit ne…