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