Approximation algorithms for clustering with dynamic points.
Shichuan DengJian LiYuval RabaniPublished in: J. Comput. Syst. Sci. (2022)
Keyphrases
- approximation algorithms
- np hard
- data points
- vertex cover
- special case
- worst case
- minimum cost
- clustering algorithm
- facility location problem
- approximation ratio
- primal dual
- k means
- network design problem
- randomized algorithms
- precedence constraints
- set cover
- constant factor approximation
- constant factor
- exact algorithms
- approximation schemes
- arbitrary shape
- open shop
- simulated annealing