Pages that link to "Item:Q5917892"
From MaRDI portal
The following pages link to Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892):
Displayed 9 items.
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)
- Improved deterministic leader election in diameter-two networks (Q6057346) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)