P
Peter Sanders
Researcher at Karlsruhe Institute of Technology
Publications - 420
Citations - 17918
Peter Sanders is an academic researcher from Karlsruhe Institute of Technology. The author has contributed to research in topics: Graph partition & Parallel algorithm. The author has an hindex of 64, co-authored 399 publications receiving 16388 citations. Previous affiliations of Peter Sanders include Max Planck Society & Goethe University Frankfurt.
Papers
More filters
Journal ArticleDOI
Polynomial time algorithms for multicast network code construction
Sidharth Jaggi,Peter Sanders,Philip A. Chou,Michelle Effros,Sebastian Egner,K. Jain,Ludo Tolhuizen +6 more
TL;DR: Deterministic polynomial time algorithms and even faster randomized algorithms for designing linear codes for directed acyclic graphs with edges of unit capacity are given and extended to integer capacities and to codes that are tolerant to edge failures.
Book ChapterDOI
Contraction hierarchies: faster and simpler hierarchical routing in road networks
TL;DR: CHs can be combined with many other route planning techniques, leading to improved performance for many-to-many routing, transit-node routing, goal-directed routing or mobile and dynamic scenarios, and a hierarchical query algorithm using bidirectional shortest-path search is obtained.
Book ChapterDOI
Route Planning in Transportation Networks
Hannah Bast,Daniel Delling,Andrew V. Goldberg,Matthias Müller-Hannemann,Thomas Pajor,Peter Sanders,Dorothea Wagner,Renato F. Werneck +7 more
TL;DR: In this article, the authors survey recent advances in algorithms for route planning in transportation networks, and show that one can compute driving directions in milliseconds or less even at continental scale for road networks, while others can deal efficiently with real-time traffic.
Book ChapterDOI
Recent Advances in Graph Partitioning
TL;DR: In this article, the authors survey recent trends in practical algorithms for balanced graph partitioning, point to applications, and discuss future research directions, and present a survey of the most popular algorithms.
Book ChapterDOI
Engineering Route Planning Algorithms
TL;DR: An overview of the techniques enabling the development of algorithms for route planning in transportation networks and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-dependent routing, and flexible objective functions.