Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892)

From MaRDI portal
Revision as of 13:50, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    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 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references