eng
Schloss Dagstuhl β Leibniz-Zentrum fΓΌr Informatik
Leibniz International Proceedings in Informatics
1868-8969
2022-12-14
4:1
4:14
10.4230/LIPIcs.IPEC.2022.4
article
FPT Approximation for Fair Minimum-Load Clustering
Bandyapadhyay, Sayan
1
Fomin, Fedor V.
1
https://orcid.org/0000-0003-1955-4612
Golovach, Petr A.
1
https://orcid.org/0000-0002-2619-2990
Purohit, Nidhi
1
Simonov, Kirill
2
Department of Informatics, University of Bergen, Norway
Algorithms and Complexity Group, TU Wien, Austria
In this paper, we consider the Minimum-Load k-Clustering/Facility Location (MLkC) problem where we are given a set P of n points in a metric space that we have to cluster and an integer k > 0 that denotes the number of clusters. Additionally, we are given a set F of cluster centers in the same metric space. The goal is to select a set C β F of k centers and assign each point in P to a center in C, such that the maximum load over all centers is minimized. Here the load of a center is the sum of the distances between it and the points assigned to it.
Although clustering/facility location problems have rich literature, the minimum-load objective has not been studied substantially, and hence MLkC has remained a poorly understood problem. More interestingly, the problem is notoriously hard even in some special cases including the one in line metrics as shown by Ahmadian et al. [APPROX 2014, ACM Trans. Algorithms 2018]. They also show APX-hardness of the problem in the plane. On the other hand, the best-known approximation factor for MLkC is O(k), even in the plane.
In this work, we study a fair version of MLkC inspired by the work of Chierichetti et al. [NeurIPS, 2017]. Here the input points are partitioned into π protected groups, and only clusters that proportionally represent each group are allowed. MLkC is the special case with π = 1. For the fair version, we are able to obtain a randomized 3-approximation algorithm in f(k,π)β
n^O(1) time. Also, our scheme leads to an improved (1 + Ξ΅)-approximation in the case of Euclidean norm with the same running time (depending also linearly on the dimension d). Our results imply the same approximations for MLkC with running time f(k)β
n^O(1), achieving the first constant-factor FPT approximations for this problem in general and Euclidean metric spaces.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol249-ipec2022/LIPIcs.IPEC.2022.4/LIPIcs.IPEC.2022.4.pdf
fair clustering
load balancing
parameterized approximation