On Metric Clustering to Minimize the Sum of Radii (Q3512466): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-69903-3_26
+Normal rank
@@ Property / OpenAlex ID @@
+W1496527880
@@ Property / OpenAlex ID: W1496527880 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3601572
@@ Property / cites work: Q3601572 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the sum of cluster diameters
+Normal rank
@@ Property / cites work @@
+A randomized approximation scheme for metric MAX-CUT
+Normal rank
@@ Property / cites work @@
+Q2708233
@@ Property / cites work: Q2708233 / rank @@
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579384
@@ Property / cites work: Q3579384 / rank @@
+Normal rank
@@ Property / cites work @@
+A Best Possible Heuristic for the <i>k</i>-Center Problem
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians
+Normal rank
@@ Property / cites work @@
+Q5501341
@@ Property / cites work: Q5501341 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for base station coverage with minimum total radii
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank