The following pages link to All-pairs small-stretch paths (Q2729642):
Displaying 17 items.
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- All pairs shortest paths for graphs with small integer length edges (Q1356883) (← links)
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- Faster algorithms for all-pairs small stretch distances in weighted graphs (Q2429342) (← links)
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization (Q2816298) (← links)
- All pairs lightest shortest paths (Q2819534) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Q5458845) (← links)
- (Q5743389) (← links)
