All-pairs shortest paths with a sublinear additive error
From MaRDI portal
Recommendations
- All-Pairs Shortest Paths with a Sublinear Additive Error
- scientific article; zbMATH DE number 7740882
- An almost 2-approximation for all-pairs of shortest paths in subquadratic time
- scientific article; zbMATH DE number 1979485
- Subcubic cost algorithms for the all pairs shortest path problem
- All-Pairs Almost Shortest Paths
- Decremental all-pairs shortest paths in deterministic near-linear time
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
- All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing
- scientific article; zbMATH DE number 219247
Cited in
(10)- On random perfect matchings in metric spaces with not-too-large diameters
- Improved distance queries and cycle counting by Frobenius normal form
- scientific article; zbMATH DE number 5899282 (Why is no real title available?)
- All-Pairs Shortest Paths with a Sublinear Additive Error
- Approximate shortest paths in weighted graphs
- All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing
- Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
- Algorithms and Computation
- A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs
- A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
This page was built for publication: All-pairs shortest paths with a sublinear additive error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189029)
