3 citations · 6 across the 3 of their papers we have counts for
4 papers
Pruning Techniques for the Stochastic on-time Arrival Problem\texorpdfstring -- An Experimental Study
Moritz Kobitzsch, Samitha Samaranayake, Dennis Schieferdecker
Computing shortest paths is one of the most researched topics in algorithm engineering. Currently available algorithms compute shortest paths in mere fractions of a second on conti…
Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing
Dennis Luxen, Dennis Schieferdecker
Contraction Hierarchies is a successful speedup-technique to Dijkstra's seminal shortest path algorithm that has a convenient trade-off between preprocessing and query times. We in…
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks
Dennis Schieferdecker, Markus Völker, Dorothea Wagner
We propose two novel algorithms for distributed and location-free boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it…
Heuristic Contraction Hierarchies with Approximation Guarantee
Robert Geisberger
We present a new heuristic point-to-point routing algorithm based on contraction hierarchies (CH). Given an epsilon >= 0, we can prove that the length of the path computed by our a…