Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing

DOI10.1007/978-3-662-48971-0_41zbMath1472.68114OpenAlexW2404554259MaRDI QIDQ3459885

Sabine Storandt, Stefan Funke

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_41

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Related Items (4)

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels ⋮ Search-space size in contraction hierarchies ⋮ Unnamed Item ⋮ Sublinear search spaces for shortest path planning in grid and road networks

This page was built for publication: Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing