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. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 02:30, 22 July 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
