Parameterized upper bounds for path-consistent hub labeling

DOI10.1007/978-3-031-63021-7_34MaRDI QIDQ7021074zbMATH OpenFDO

Authors Stefan Funke, Sabine Storandt

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_34

zbMATH Keywords

hub labelingskeleton dimensiongeodetic transversal number

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• Algorithmic and hardness results for the hub labeling problem
• Algorithms for landmark hub labeling
• Beyond highway dimension: small distance labels using tree skeletons
• Computation and growth of road network dimensions
• Experimental algorithms. 12th international symposium, SEA 2013, Rome, Italy, June 5--7, 2013. Proceedings
• Hierarchical hub labelings for shortest paths
• Highway dimension and provably efficient shortest path algorithms
• On the complexity of hub labeling (extended abstract)
• Preprocessing speed-up techniques is hard
• Reachability and Distance Queries via 2-Hop Labels
• Search-space size in contraction hierarchies
• The geodesic-transversal problem
• VC-dimension and shortest path algorithms

This page was built for publication: Parameterized upper bounds for path-consistent hub labeling

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