Improved Approximation Algorithms for Individually Fair Clustering.
Ali VakilianMustafa YalçinerPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- worst case
- facility location problem
- clustering algorithm
- minimum cost
- approximation ratio
- k means
- approximation schemes
- open shop
- network design problem
- constant factor
- primal dual
- set cover
- randomized algorithms
- disjoint paths
- exact algorithms
- undirected graph
- theoretical analysis
- learning algorithm