Pages that link to "Item:Q1954259"
From MaRDI portal
The following pages link to A fast distributed approximation algorithm for minimum spanning trees (Q1954259):
Displaying 17 items.
- A fast minimum spanning tree algorithm based on \(K\)-means (Q527132) (← links)
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979) (← links)
- Fast Distributed Construction of Smallk-Dominating Sets and Applications (Q4216145) (← links)
- (Q4250790) (← 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)
- (Q5090922) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- A linear-time optimal-message distributed algorithm for minimum spanning trees (Q5138511) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892) (← links)
