On parameterized approximation algorithms for balanced clustering.
Xiangyan KongZhen ZhangQilong FengPublished in: J. Comb. Optim. (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- k means
- clustering algorithm
- approximation ratio
- minimum cost
- exact algorithms
- open shop
- worst case
- randomized algorithms
- primal dual
- facility location problem
- network design problem
- disjoint paths
- approximation schemes
- constant factor
- precedence constraints
- np hardness
- approximation guarantees
- information theoretic
- set cover
- genetic algorithm
- linear programming
- supervised learning
- search algorithm
- similarity function