Approximate distance oracles with improved preprocessing time
From MaRDI portal
(Redirected from Publication:5743389)
Recommendations
Cites work
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
- A new approach to all-pairs shortest paths on real-weighted graphs
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- All-Pairs Almost Shortest Paths
- All-pairs small-stretch paths
- Approximate distance oracles
- Approximating Shortest Paths in Graphs
- Automata, Languages and Programming
- Distance oracles beyond the Thorup-Zwick bound
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- More algorithms for all-pairs shortest paths in weighted graphs
- New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners
- Ramsey partitions and proximity data structures
- Spanners and emulators with sublinear distance errors
Cited in
(18)- Constructing light spanners deterministically in near-linear time
- An axiomatic approach to time-dependent shortest path oracles
- Improved distance sensitivity oracles with subcubic preprocessing time
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
- Constructing Light Spanners Deterministically in Near-Linear Time
- Optimal (Euclidean) Metric Compression
- Faster approximation algorithms for computing shortest cycles on weighted graphs
- Distance sensitivity oracles with subcubic preprocessing time and fast query time
- Space-efficient path-reporting approximate distance oracles
- Approximate distance oracle in \(O(n ^{2})\) time and \(O(n)\) space for chordal graphs
- Analysis and Experimental Evaluation of Time-Dependent Distance Oracles
- Approximate distance oracles with constant query time
- Approximate distance oracles with improved query time
- Close to linear space routing schemes
- New algorithms for all pairs approximate shortest paths
- Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
- New approximate distance oracles and their applications
This page was built for publication: Approximate distance oracles with improved preprocessing time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743389)
