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