Lower bounds in the preprocessing and query phases of routing algorithms

DOI10.1007/978-3-662-48350-3_84MaRDI QIDQ3452861zbMATH OpenOpenAlexFDO

Authors Colin White

Publication date 19 November 2015

Published in Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.04262

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Abstract: In the last decade, there has been a substantial amount of research in finding routing algorithms designed specifically to run on real-world graphs. In 2010, Abraham et al. showed upper bounds on the query time in terms of a graph's highway dimension and diameter for the current fastest routing algorithms, including contraction hierarchies, transit node routing, and hub labeling. In this paper, we show corresponding lower bounds for the same three algorithms. We also show how to improve a result by Milosavljevic which lower bounds the number of shortcuts added in the preprocessing stage for contraction hierarchies. We relax the assumption of an optimal contraction order (which is NP-hard to compute), allowing the result to be applicable to real-world instances. Finally, we give a proof that optimal preprocessing for hub labeling is NP-hard. Hardness of optimal preprocessing is known for most routing algorithms, and was suspected to be true for hub labeling.

Recommendations

• Highway dimension and provably efficient shortest path algorithms
• Hierarchical hub labelings for shortest paths
• Provable efficiency of contraction hierarchies with randomized preprocessing
• Algorithms for hub label optimization
• Engineering Highway Hierarchies

Cites work

• Distance labeling in graphs (extended abstract)
• Highway dimension, shortest paths, and provably efficient algorithms
• On the complexity of hub labeling (extended abstract)
• Preprocessing speed-up techniques is hard
• Reachability and Distance Queries via 2-Hop Labels

Cited in

(5)

• Sublinear search spaces for shortest path planning in grid and road networks
• scientific article; zbMATH DE number 1340883 (Why is no real title available?)
• Computing constrained shortest-paths at scale
• A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels
• scientific article; zbMATH DE number 7651159 (Why is no real title available?)

This page was built for publication: Lower bounds in the preprocessing and query phases of routing algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452861)