Dynamic clustering to minimize the sum of radii (Q2205631): Difference between revisions

@@ Property / cites work @@
+Dynamic set cover: improved algorithms and lower bounds
+Normal rank
@@ Property / cites work @@
+Q3601572
@@ Property / cites work: Q3601572 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Clustering via Metric Partitioning
@@ Property / cites work: Approximate Clustering via Metric Partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
+Normal rank
@@ Property / cites work @@
+On minimum sum of radii and diameters clustering
@@ Property / cites work: On minimum sum of radii and diameters clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Design of Dynamic Algorithms via Primal-Dual Method
+Normal rank
@@ Property / cites work @@
+Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
+Normal rank
@@ Property / cites work @@
+New deterministic approximation algorithms for fully dynamic matching
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time
+Normal rank
@@ Property / cites work @@
+The Design of Competitive Online Algorithms via a Primal—Dual Approach
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the sum of cluster diameters
+Normal rank
@@ Property / cites work @@
+Online clustering with variable sized clusters
@@ Property / cites work: Online clustering with variable sized clusters / rank @@
+Normal rank
@@ Property / cites work @@
+Q2708233
@@ Property / cites work: Q2708233 / rank @@
+Normal rank
@@ Property / cites work @@
+Online Sum-Radii Clustering
@@ Property / cites work: Online Sum-Radii Clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579384
@@ Property / cites work: Q3579384 / rank @@
+Normal rank
@@ Property / cites work @@
+On Metric Clustering to Minimize the Sum of Radii
@@ Property / cites work: On Metric Clustering to Minimize the Sum of Radii / rank @@
+Normal rank
@@ Property / cites work @@
+Q5009599
@@ Property / cites work: Q5009599 / rank @@
+Normal rank
@@ Property / cites work @@
+Online and dynamic algorithms for set cover
@@ Property / cites work: Online and dynamic algorithms for set cover / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum sum of diameters clustering
@@ Property / cites work: Minimum sum of diameters clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster analysis and mathematical programming
@@ Property / cites work: Cluster analysis and mathematical programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111737
@@ Property / cites work: Q5111737 / rank @@
+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 @@
+Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
+Normal rank
@@ Property / cites work @@
+Graph clustering
@@ Property / cites work: Graph clustering / rank @@
+Normal rank