NP-hardness of Euclidean sum-of-squares clustering (Q1009338): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/ml/AloiseDHP09, #quickstatements; #temporary_batch_1731543907597 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q2934696 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of the single individual SNP haplotyping problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Clustering large graphs via the singular value decomposition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cluster analysis and mathematical programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sparsest cuts and bottlenecks in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5617409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The effectiveness of lloyd-type methods for the k-means problem / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ml/AloiseDHP09 / rank | |||
Normal rank | |||
Revision as of 01:33, 14 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness of Euclidean sum-of-squares clustering |
scientific article |
Statements
NP-hardness of Euclidean sum-of-squares clustering (English)
0 references
31 March 2009
0 references
sum-of-squares clustering
0 references
complexity
0 references
