NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q126788242, #quickstatements; #temporary_batch_1723538522512 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / cites work | |||
| Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding k points with minimum diameter and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3996232 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s1064562419050028 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2986153947 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126788242 / rank | |||
Normal rank | |||
Latest revision as of 09:49, 13 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters |
scientific article |
Statements
NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (English)
0 references
11 March 2020
0 references
partitioning
0 references
set of points in Euclidean space
0 references
clusters
0 references
intracluster quadratic variance
0 references
cluster size
0 references
NP-completeness
0 references
