Exact and approximate hierarchical hub labeling

DOI10.1007/978-981-97-0566-5_15MaRDI QIDQ6575394zbMATH OpenFDO

Authors Ruoying Li, Sabine Storandt

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-981-97-0566-5_15

zbMATH Keywords

approximationhub labelingseparatorshortest path

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Algorithmic and hardness results for the hub labeling problem
• An Experimental Study of the Treewidth of Real-World Graph Data
• Beyond highway dimension: small distance labels using tree skeletons
• Constant factor approximation of vertex-cuts in planar graphs
• Fast shortest-path distance queries on road networks by pruned highway labeling
• Hierarchical hub labelings for shortest paths
• Highway dimension and provably efficient shortest path algorithms
• On the complexity of hub labeling (extended abstract)
• Proximity-preserving labeling schemes
• Reachability and Distance Queries via 2-Hop Labels
• Search-space size in contraction hierarchies
• Separating Hierarchical and General Hub Labelings

Cited in

(1)

• The complexity of landmark hub labeling

This page was built for publication: Exact and approximate hierarchical hub labeling

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