Optimal forks: preprocessing single-source shortest path instances with interval data

DOI10.4230/OASICS.ATMOS.2021.7MaRDI QIDQ6587282FDOQ6587282

Authors: Niels Lindner, Pedro Maristany de las Casas, Philine Schiewe 

Publication date: 13 August 2024

Recommendations

• Reach for \(A^*\): shortest path algorithms with preprocessing
• Engineering Highway Hierarchies
• Preprocessing speed-up techniques is hard
• Point-to-Point Shortest Path Algorithms with Preprocessing
• Reach for \(A^\ast\): efficient point-to-point shortest path algorithms

zbMATH Keywords

graph algorithmsinterval datapreprocessing shortest path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

This page was built for publication: Optimal forks: preprocessing single-source shortest path instances with interval data

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