Jan 13, 2022 · As our main contribution, a 4-approximation algorithm is presented, based on which we develop an improved algorithm from a practical perspective ...

Jun 17, 2022 · We introduce the individually fair k-center with outliers (IFkCO) in this paper, which allows some vertices, called outliers, to be discarded when clustering.

In this paper, we propose and investigate the individually fair k-center with outliers (IFkCO). In the IFkCO, we are given an n-sized vertex set in a metric ...

A 4-approximation algorithm is presented, based on which an improved algorithm from a practical perspective is developed, based on which the maximum ...

In this paper, we propose and investigate the individually fair k-center with outliers (IFkCO). In the IFkCO, we are given an n-sized vertex set in a metric ...

Jan 13, 2022 · At most $k$ vertices can be selected as the centers and at most $q$ vertices can be selected as the outliers. The centers are selected to serve ...

[2020]: given a set of points P of size n, a set of k centers induces a fair clustering if every point in P has a center among its n/k closest neighbors.

Approximation algorithms for the individually fair k-center with outliers. Lu Han, Dachuan Xu, Yicheng Xu, Ping Yang. 2022, Journal of Global Optimization.

Our framework extends to generalizations of Priority k-Center to matroid and knapsack constraints, and as a corollary, also yields algorithms with fairness.

Aug 26, 2023 · In this paper, we study the Fixed-Parameter Tractability (FPT) approximation algorithm and polynomial approximation algorithm for the FkCO ...