Near-optimal clustering in the \(k\)-machine model (Q2062125): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3214748966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data stream clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228450 / 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: Q4250234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Median Problem / 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 new greedy approach for facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search heuristic for k-median and facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick <i>k</i>-Median, <i>k</i>-Center, and Facility Location for Sparse Graphs / 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: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Optimal Bounds in the Congested Clique / 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: Fast Approximate Shortest Paths in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially Faster Shortest Paths in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-logarithmic distributed algorithms for metric facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / 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: A Biological Solution to a Fundamental Distributed Computing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of symmetry breaking in massive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal approximate shortest paths and transshipment in distributed and streaming models / rank
 
Normal rank

Revision as of 12:05, 4 December 2024

scientific article
Language Label Description Also known as
English
Near-optimal clustering in the \(k\)-machine model
scientific article

    Statements

    Near-optimal clustering in the \(k\)-machine model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 December 2021
    0 references
    clustering
    0 references
    facility location
    0 references
    \(k\)-median
    0 references
    \(k\)-center
    0 references
    \(k\)-machine model
    0 references
    large-scale clustering
    0 references
    distributed clustering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers