Preprocessing speed-up techniques is hard
From MaRDI portal
Publication:3563016
Recommendations
Cited in
(13)- Bundling all shortest paths
- Lower bounds in the preprocessing and query phases of routing algorithms
- Exact distance oracles for planar graphs
- On the complexity of partitioning graphs for arc-flags
- Graph bisection with Pareto optimization
- Shortest-path queries in static networks
- Preprocessing for segment routing optimization
- Customizable contraction hierarchies
- scientific article; zbMATH DE number 7651159 (Why is no real title available?)
- Search-space size in contraction hierarchies
- Precomputation techniques for the stochastic on-time arrival problem
- Speed-Up Techniques for Shortest-Path Computations
- Optimal forks: preprocessing single-source shortest path instances with interval data
This page was built for publication: Preprocessing speed-up techniques is hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563016)