New algorithms for all pairs approximate shortest paths
From MaRDI portal
Publication:6499232
DOI10.1145/3564246.3585197MaRDI QIDQ6499232
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Space-efficient path-reporting approximate distance oracles
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- Ramsey partitions and proximity data structures
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
- Approximate Distance Oracles with Improved Bounds
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Powers of tensors and fast matrix multiplication
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Faster Approximation of Distances in Graphs
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing
- All-Pairs Almost Shortest Paths
- A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- An almost 2-approximation for all-pairs of shortest paths in subquadratic time
- Brief announcement
- Approximate distance oracles with constant query time
- Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
- Multiplying matrices faster than coppersmith-winograd
- Distance Oracles beyond the Thorup--Zwick Bound
- Computing almost shortest paths
This page was built for publication: New algorithms for all pairs approximate shortest paths
