• Publications
  • Influence
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
TLDR
We present a route planning technique solely based on the concept of node contraction. Expand
  • 629
  • 66
  • PDF
Polynomial time algorithms for multicast network code construction
TLDR
We present polynomial time algorithms for the design of maximum rate linear multicast network codes by combining techniques from linear algebra, network flows, and (de)randomization. Expand
  • 965
  • 53
  • PDF
Exact Routing in Large Road Networks Using Contraction Hierarchies
TLDR
We exploit the inherent hierarchical structure of road networks by adding shortcut edges. Expand
  • 257
  • 31
Simple Linear Work Suffix Array Construction
TLDR
We introduce the skew algorithm for suffix array construction over integer alphabets that can be implemented to run in linear time using integer sorting as its only nontrivial subroutine. Expand
  • 466
  • 30
  • PDF
Route Planning in Transportation Networks
TLDR
We survey recent advances in algorithms for route planning in transportation networks. Expand
  • 488
  • 28
  • PDF
Linear work suffix array construction
TLDR
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Expand
  • 381
  • 28
  • PDF
Δ-stepping: a parallelizable shortest path algorithm
TLDR
The single source shortest path problem for arbitrary directed graphs with n nodes, m edges and nonnegative edge weights can sequentially be solved using O(n.log n + log 2 n) time and O( n + m + d L.L) total average-case time, where L denotes the maximum shortest path weight from the source node s to any node reachable from s. Expand
  • 167
  • 28
STXXL: standard template library for XXL data sets
TLDR
We present the software library STXXL that is an implementation of the C++ standard template library (STL) for processing huge data sets that can fit only on hard disks. Expand
  • 163
  • 24
  • PDF
Better Approximation of Betweenness Centrality
TLDR
In this paper, we propose a framework for unbiased approximation of betweenness that generalizes a previous approach by Brandes. Expand
  • 213
  • 21
  • PDF
In Transit to Constant Time Shortest-Path Queries in Road Networks
TLDR
We develop an algorithmic approach---transit node routing---that allows us to reduce quickest-path queries in road networks to a small number of table lookups. Expand
  • 225
  • 20
  • PDF
...
1
2
3
4
5
...