97 citations · 392 across the 64 of their papers we have counts for
5 papers · 2 filters
Engineering Multilevel Graph Partitioning Algorithms
Peter Sanders, Christian Schulz
We present a multi-level graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from the multi-grid community. Local improve…
Compressed Transmission of Route Descriptions
Gernot Veit Batz, Robert Geisberger, Dennis Luxen +1
We present two methods to compress the description of a route in a road network, i.e., of a path in a directed graph. The first method represents a path by a sequence of via edges.…
Faster Radix Sort via Virtual Memory and Write-Combining
Jan Wassenberg, Peter Sanders
Sorting algorithms are the deciding factor for the performance of common operations such as removal of duplicates or database sort-merge joins. This work focuses on 32-bit integer…
n-Level Graph Partitioning
Vitaly Osipov, Peter Sanders
We present a multi-level graph partitioning algorithm based on the extreme idea to contract only a single edge on each level of the hierarchy. This obviates the need for a matching…
Defining and Computing Alternative Routes in Road Networks
Jonathan Dees, Robert Geisberger, Peter Sanders +1
Every human likes choices. But today's fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative rou…