Sub-logarithmic distributed algorithms for metric facility location (Q748120): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-015-0243-x / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Pregel / rank
 
Normal rank
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-015-0243-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087568912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-Fast Distributed Algorithms for Metric Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of the congested clique model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed O(1)-approximation algorithm for the uniform facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lessons from the Congested Clique Applied to MapReduce / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Plant and Warehouse Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computation of Large-scale Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal deterministic routing and sorting on the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parallel randomized load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed MST for constant diameter graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Return of the primal-dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid randomized pruning for fast greedy distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The round complexity of distributed sorting / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-015-0243-X / rank
 
Normal rank

Latest revision as of 03:02, 10 December 2024

scientific article
Language Label Description Also known as
English
Sub-logarithmic distributed algorithms for metric facility location
scientific article

    Statements

    Sub-logarithmic distributed algorithms for metric facility location (English)
    0 references
    0 references
    0 references
    20 October 2015
    0 references

    Identifiers