19 citations · 29 across the 5 of their papers we have counts for
6 papers
Customizable Contraction Hierarchies -- A Survey
Thomas Bläsius, Valentin Buchhold, Dorothea Wagner +2
This work establishes the technical fundamentals of a well-tuned Customizable Contraction Hierarchies (CCH) implementation that is simple and elegant. We give a detailed overview o…
Combining Predicted and Live Traffic with Time-Dependent A* Potentials
Nils Werner, Tim Zeitz
We study efficient and exact shortest path algorithms for routing on road networks with realistic traffic data. For navigation applications, both current (i.e., live) traffic event…
Efficient Route Planning with Temporary Driving Bans, Road Closures, and Rated Parking Areas
Alexander Kleff, Frank Schulz, Jakob Wagenblatt +1
We study the problem of planning routes in road networks when certain streets or areas are closed at certain times. For heavy vehicles, such areas may be very large since many Euro…
Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks
Ben Strasser, Dorothea Wagner, Tim Zeitz
We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, fo…
A Fast and Tight Heuristic for A* in Road Networks
Ben Strasser, Tim Zeitz
We study exact, efficient and practical algorithms for route planning in large road networks. Routing applications often require integrating the current traffic situation, planning…
Distributed Graph Clustering using Modularity and Map Equation
Michael Hamann, Ben Strasser, Dorothea Wagner +1
We study large-scale, distributed graph clustering. Given an undirected graph, our objective is to partition the nodes into disjoint sets called clusters. A cluster should contain…