Pages that link to "Item:Q5145183"
From MaRDI portal
The following pages link to Fast Approximate Shortest Paths in the Congested Clique (Q5145183):
Displayed 7 items.
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)