All-pairs small-stretch paths
From MaRDI portal
Recommendations
- Faster algorithms for all-pairs small stretch distances in weighted graphs
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- STACS 2005
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
Cited in
(20)- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- All pairs shortest paths for graphs with small integer length edges
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- Fast approximate shortest paths in the congested clique
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- New length bounds for cycle bases
- Faster algorithms for all-pairs small stretch distances in weighted graphs
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- All pairs lightest shortest paths
- Approximating Shortest Paths in Graphs
- Some results on approximate 1-median selection in metric spaces
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
- Approximate distance oracles with improved preprocessing time
- Stronger 3-SUM lower bounds for approximate distance oracles via additive combinatorics
- New tradeoffs for decremental approximate all-pairs shortest paths
- Efficient approximation algorithms for shortest cycles in undirected graphs
This page was built for publication: All-pairs small-stretch paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729642)
