New algorithms for all pairs approximate shortest paths
From MaRDI portal
Publication:6499232
Cites work
- A linear-size logarithmic stretch path-reporting distance oracle for general graphs
- All-Pairs Almost Shortest Paths
- All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
- An almost 2-approximation for all-pairs of shortest paths in subquadratic time
- Approximate distance oracles
- Approximate distance oracles with constant query time
- Approximate distance oracles with improved bounds
- Approximate distance oracles with improved preprocessing time
- Brief announcement: A simple stretch 2 distance oracle
- Computing almost shortest paths
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Distance oracles beyond the Thorup-Zwick bound
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Faster Approximation of Distances in Graphs
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Multiplying matrices faster than coppersmith-winograd
- On approximate distance labels and routing schemes with affine stretch
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- Powers of tensors and fast matrix multiplication
- Ramsey partitions and proximity data structures
- Space-efficient path-reporting approximate distance oracles
This page was built for publication: New algorithms for all pairs approximate shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499232)
