Dynamic clustering to minimize the sum of radii

DOI10.4230/LIPICS.ESA.2017.48zbMATH Open1442.90118arXiv1707.02577MaRDI QIDQ5111737FDOQ5111737

Dariusz Leniowski, Monika R. Henzinger, Claire Mathieu

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1707.02577

Recommendations

• Dynamic clustering to minimize the sum of radii
• Dynamic sum-radii clustering
• Online sum-radii clustering
• Online sum-radii clustering
• Clustering to minimize the sum of cluster diameters

zbMATH Keywords

clusteringapproximationdoubling dimensiondynamic algorithm

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Cites Work

• Graph clustering
• Cluster analysis and mathematical programming
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• Online clustering with variable sized clusters
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Minimum-cost coverage of point sets by disks
• On Metric Clustering to Minimize the Sum of Radii
• Online and dynamic algorithms for set cover
• Clustering to minimize the sum of cluster diameters
• Title not available (Why is that?)
• Approximation algorithms for clustering to minimize the sum of diameters
• On minimum sum of radii and diameters clustering
• Minimum sum of diameters clustering
• Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
• Title not available (Why is that?)
• Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
• Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
• Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time
• Design of Dynamic Algorithms via Primal-Dual Method
• Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log³ n) Worst Case Update Time
• Approximate Clustering via Metric Partitioning
• Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
• New deterministic approximation algorithms for fully dynamic matching
• Online Sum-Radii Clustering

Cited In (6)

• Approximating fair \(k\)-min-sum-radii in Euclidean space
• On the Facility Location Problem in Online and Dynamic Models.
• Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering
• Title not available (Why is that?)
• Clustering to minimize the sum of cluster diameters
• Dynamic clustering to minimize the sum of radii

This page was built for publication: Dynamic clustering to minimize the sum of radii

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111737)