The following pages link to (Q5501268):
Displayed 6 items.
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)