Sublinear search spaces for shortest path planning in grid and road networks
From MaRDI portal
Publication:2230730
DOI10.1007/S10878-021-00777-3zbMATH Open1477.90116OpenAlexW3191480933MaRDI QIDQ2230730FDOQ2230730
Authors: Johannes Blum, Stefan Funke, Sabine Storandt 
Publication date: 28 September 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00777-3
Recommendations
Cites Work
- Distance labeling in graphs
- \(\epsilon\)-nets and simplex range queries
- Almost optimal set covers in finite VC-dimension
- Graph minors. V. Excluding a planar graph
- VC-dimension and shortest path algorithms
- Provable efficiency of contraction hierarchies with randomized preprocessing
- Highway dimension, shortest paths, and provably efficient algorithms
- Distributed Computing
- Fast Routing in Road Networks with Transit Nodes
- Highway dimension and provably efficient shortest path algorithms
- Beyond highway dimension: small distance labels using tree skeletons
- Search-space size in contraction hierarchies
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Hierarchy of Transportation Network Parameters and Hardness Results
- Robust distance queries on massive networks
- Computation and growth of road network dimensions
- Title not available (Why is that?)
- Lower bounds in the preprocessing and query phases of routing algorithms
- Transit nodes -- lower bounds and refined construction
- Customizable contraction hierarchies
Cited In (4)
This page was built for publication: Sublinear search spaces for shortest path planning in grid and road networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230730)
