Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (Q2043627): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0081543821030123 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3183214496 / rank | |||
Normal rank | |||
Latest revision as of 09:43, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability |
scientific article |
Statements
Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (English)
0 references
3 August 2021
0 references
Euclidean space
0 references
clustering
0 references
2-partition
0 references
quadratic variation
0 references
center
0 references
centroid
0 references
median
0 references
strong NP-hardness
0 references
nonexistence of FPTAS
0 references
approximation-preserving reduction
0 references
