NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+Worst-Case and Probabilistic Analysis of a Geometric Location Problem
+Normal rank
@@ Property / cites work @@
+Finding k points with minimum diameter and related problems
+Normal rank
@@ Property / cites work @@
+Q3996232
@@ Property / cites work: Q3996232 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1064562419050028
+Normal rank
@@ Property / OpenAlex ID @@
+W2986153947
@@ Property / OpenAlex ID: W2986153947 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q126788242
@@ Property / Wikidata QID: Q126788242 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2304346