Constant-factor approximation algorithms for some maximin multi-clustering problems (Q6134049): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-031-35305-5_6
+Normal rank
@@ Property / OpenAlex ID @@
+W4381956509
@@ Property / OpenAlex ID: W4381956509 / rank @@
+Normal rank
@@ Property / cites work @@
+Outlier Analysis
@@ Property / cites work: Outlier Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+Q2768359
@@ Property / cites work: Q2768359 / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
+Normal rank
@@ Property / cites work @@
+On the complexity of some quadratic Euclidean partition problems into balanced clusters
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for geometric median problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6134049