NP-hardness of Euclidean sum-of-squares clustering (Q1009338): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10994-009-5103-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2086959852
@@ Property / OpenAlex ID: W2086959852 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934696
@@ Property / cites work: Q2934696 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the single individual SNP haplotyping problem
+Normal rank
@@ Property / cites work @@
+Clustering large graphs via the singular value decomposition
+Normal rank
@@ Property / cites work @@
+Cluster analysis and mathematical programming
@@ Property / cites work: Cluster analysis and mathematical programming / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsest cuts and bottlenecks in graphs
@@ Property / cites work: Sparsest cuts and bottlenecks in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5617409
@@ Property / cites work: Q5617409 / rank @@
+Normal rank
@@ Property / cites work @@
+The effectiveness of lloyd-type methods for the k-means problem
+Normal rank
@@ Property / DBLP publication ID @@
+journals/ml/AloiseDHP09
@@ Property / DBLP publication ID: journals/ml/AloiseDHP09 / rank @@
+Normal rank