On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:18, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of clustering with relaxed size constraints in fixed dimension |
scientific article |
Statements
On the complexity of clustering with relaxed size constraints in fixed dimension (English)
0 references
13 March 2018
0 references
geometric clustering problems
0 references
cluster-size constraints
0 references
computational complexity
0 references
constrained \(k\)-means
0 references
