Approximation Algorithms for Clustering with Dynamic Points.
Shichuan DengJian LiYuval RabaniPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- data points
- minimum cost
- worst case
- clustering algorithm
- vertex cover
- randomized algorithms
- facility location problem
- primal dual
- network design problem
- open shop
- set cover
- k means
- precedence constraints
- disjoint paths
- approximation schemes
- exact algorithms
- arbitrary shape
- constant factor
- approximation ratio
- linear programming
- genetic algorithm