Approximation Algorithms for Fair Range Clustering.
Sèdjro Salomon HotegniSepideh MahabadiAli VakilianPublished in: ICML (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- clustering algorithm
- vertex cover
- k means
- open shop
- minimum cost
- network design problem
- approximation ratio
- facility location problem
- randomized algorithms
- primal dual
- disjoint paths
- data points
- np hardness
- set cover
- genetic algorithm
- constant factor approximation
- constant factor
- undirected graph
- evaluation function
- lower bound
- objective function