Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6134272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient distributed approximation algorithms via probabilistic tree embeddings |
scientific article; zbMATH DE number 6134272 |
Statements
Efficient distributed approximation algorithms via probabilistic tree embeddings (English)
0 references
4 February 2013
0 references
generalized Steiner forests
0 references
shortest paths
0 references
optimum routing cost spanning trees
0 references
least element lists
0 references
metric spaces
0 references
leader election
0 references
probabilistic tree embeddings
0 references
0 references
0 references
0.9957555532455444
0 references
0.7786148190498352
0 references
0.7767373323440552
0 references
0.7763658165931702
0 references
