Pages that link to "Item:Q5233107"
From MaRDI portal
The following pages link to Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107):
Displaying 10 items.
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Improved weighted additive spanners (Q6096039) (← links)