Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129811919, #quickstatements; #temporary_batch_1726270017965 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-018-0454-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-018-0454-1 / rank | |||
Normal rank | |||
Revision as of 06:46, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median |
scientific article |
Statements
Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (English)
0 references
11 March 2019
0 references
approximation
0 references
min-sum \(k\)-clustering
0 references
balanced \(k\)-median
0 references
hierarchically separated trees
0 references
doubling metrics
0 references
0 references
0 references
