Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-012-0157-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027018686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparser: A Paradigm for Running Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-estimation framework with applications to transitive closure and reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatially-decaying aggregation over a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed verification and hardness of distributed approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster distributed protocol for constructing a minimum spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast distributed approximation algorithm for minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of being near-sighted / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming without the matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum mechanical algorithms for the nonabelian hidden subgroup problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Weighted Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250159 / rank
 
Normal rank

Latest revision as of 03:48, 6 July 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
    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