Approximating fair k-min-sum-radii in Euclidean space

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

Authors: Lukas Drexler, Annika Hennes, Abhiruk Lahiri, Melanie Schmidt 

Publication date: 19 July 2024

Mathematics Subject Classification ID

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

Cites Work

• Two Algorithms for the Minimum Enclosing Ball Problem
• Approximate clustering via core-sets
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Algorithms – ESA 2005
• Clustering to minimize the sum of cluster diameters
• On clustering to minimize the sum of radii
• Geometric clusterings
• On minimum sum of radii and diameters clustering
• On metric clustering to minimize the sum of radii
• Privacy preserving clustering with constraints
• Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
• Approximation algorithms for clustering problems with lower bounds and outliers
• Dynamic clustering to minimize the sum of radii
• Algorithms for fair \(k\)-clustering with multiple protected attributes
• On the cost of essentially fair clusterings
• Title not available (Why is that?)

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

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