Pages that link to "Item:Q2375302"
From MaRDI portal
The following pages link to Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302):
Displayed 18 items.
- Models and algorithms for network reduction (Q320811) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← 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)
- (Q5009588) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
- Improved weighted additive spanners (Q6096039) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)