Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00446-012-0157-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00446-012-0157-9 / rank | |||
Normal rank | |||
Latest revision as of 13:50, 16 December 2024
scientific article; zbMATH DE number 6134272
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
