Algorithms for hub label optimization

DOI10.1145/2996593MaRDI QIDQ4962649zbMATH OpenOpenAlexFDO

Authors Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan, Maxim Babenko

Publication date 5 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2996593

zbMATH Keywords

distance oracleslabeling algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Algorithms for hub label optimization
• Hierarchical hub labelings for shortest paths
• Algorithmic and hardness results for the hub labeling problem
• On the complexity of hub labeling (extended abstract)
• Separating Hierarchical and General Hub Labelings

Cited in

(8)

• Hierarchical hub labelings for shortest paths
• On the complexity of hub labeling (extended abstract)
• Lower bounds in the preprocessing and query phases of routing algorithms
• Algorithmic and hardness results for the hub labeling problem
• scientific article; zbMATH DE number 7364985 (Why is no real title available?)
• Algorithms for hub label optimization
• Machine learning augmented approaches for hub location problems
• Cluster before you hallucinate: node-capacitated network design and energy efficient routing

This page was built for publication: Algorithms for hub label optimization

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