Approximation algorithms for probabilistic $k$-center clustering.
Sharareh AlipourPublished in: ICDM (2020)
Keyphrases
- approximation algorithms
- special case
- np hard
- clustering algorithm
- worst case
- vertex cover
- information theoretic
- minimum cost
- k means
- randomized algorithms
- np hardness
- network design problem
- facility location problem
- exact algorithms
- open shop
- constant factor
- primal dual
- probabilistic model
- set cover
- approximation ratio
- dynamic programming
- approximation schemes
- bayesian networks
- learning algorithm
- combinatorial auctions
- polynomial time approximation