Approximation Algorithms for Socially Fair Clustering.
Yury MakarychevAli VakilianPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- network design problem
- minimum cost
- clustering algorithm
- facility location problem
- k means
- data points
- approximation ratio
- constant factor
- open shop
- exact algorithms
- np hardness
- set cover
- randomized algorithms
- constant factor approximation
- approximation schemes
- primal dual
- information theoretic
- lower bound