Pages that link to "Item:Q2796252"
From MaRDI portal
The following pages link to Fast Partial Distance Estimation and Applications (Q2796252):
Displayed 12 items.
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← 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)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- (Q5090925) (← links)
- Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Routing schemes for hybrid communication networks (Q6145044) (← links)