The complexity of landmark hub labeling

DOI10.1007/978-3-031-92935-9_4MaRDI QIDQ6902125zbMATH OpenFDO

Authors Louann Coste, Ruoying Li, Sabine Storandt, Tobias Töpfer

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_4

zbMATH Keywords

hub labelingNP-hardnessshortest path

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Algorithmic and hardness results for the hub labeling problem
• Algorithms for landmark hub labeling
• Exact and approximate hierarchical hub labeling
• Generating Sparse 2-Spanners
• Highway dimension, shortest paths, and provably efficient algorithms
• scientific article; zbMATH DE number 3495588 (Why is no real title available?)
• On the complexity of hub labeling (extended abstract)
• On the ratio of optimal integral and fractional covers
• Reachability and Distance Queries via 2-Hop Labels
• Separating Hierarchical and General Hub Labelings

This page was built for publication: The complexity of landmark hub labeling

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