Approximating fair \(k\)-min-sum-radii in Euclidean space

DOI10.1007/978-3-031-49815-2_9MaRDI QIDQ6574937

Annika Hennes, Lukas Drexler, Melanie Schmidt, Unnamed Author, Abhiruk Lahiri

Publication date: 19 July 2024

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On minimum sum of radii and diameters clustering
• On metric clustering to minimize the sum of radii
• Clustering to minimize the sum of cluster diameters
• Algorithms for fair \(k\)-clustering with multiple protected attributes
• Polynomial time approximation schemes for base station coverage with minimum total radii
• On Clustering to Minimize the Sum of Radii
• Geometric clusterings
• Two Algorithms for the Minimum Enclosing Ball Problem
• Approximate clustering via core-sets
• Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
• Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
• Algorithms – ESA 2005
• On the cost of essentially fair clusterings

This page was built for publication: Approximating fair \(k\)-min-sum-radii in Euclidean space