scientific article; zbMATH DE number 7205026
From MaRDI portal
Publication:5111737
DOI10.4230/LIPIcs.ESA.2017.48zbMath1442.90118arXiv1707.02577MaRDI QIDQ5111737
Dariusz Leniowski, Claire Mathieu, Monika R. Henzinger
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1707.02577
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Data structures (68P05) Approximation algorithms (68W25)
Related Items (3)
Unnamed Item ⋮ Dynamic clustering to minimize the sum of radii ⋮ On the Facility Location Problem in Online and Dynamic Models.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph clustering
- On minimum sum of radii and diameters clustering
- Minimum sum of diameters clustering
- Cluster analysis and mathematical programming
- Clustering to minimize the sum of cluster diameters
- Online clustering with variable sized clusters
- Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time
- Polynomial time approximation schemes for base station coverage with minimum total radii
- Online Sum-Radii Clustering
- Design of Dynamic Algorithms via Primal-Dual Method
- On Metric Clustering to Minimize the Sum of Radii
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time
- Approximate Clustering via Metric Partitioning
- Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
- Online and dynamic algorithms for set cover
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
- New deterministic approximation algorithms for fully dynamic matching
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
This page was built for publication:
