Near-optimal clustering in the \(k\)-machine model (Q2062125): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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
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
