A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema
Sign Up to like & getrecommendations! Published in 2021 at "Algorithms"
DOI: 10.3390/a14060164
Abstract: We prove a Ω(n) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph family… read more here.
Keywords: instance based; bound query; lower bound; contraction hierarchies ... See more keywords