Approximation algorithms for stochastic clustering.
David G. HarrisShi LiThomas W. PensylAravind SrinivasanKhoa TrinhPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- np hard
- approximation schemes
- special case
- vertex cover
- facility location problem
- worst case
- clustering algorithm
- minimum cost
- primal dual
- k means
- approximation ratio
- information theoretic
- randomized algorithms
- set cover
- open shop
- exact algorithms
- constant factor
- np hardness
- approximation guarantees
- genetic algorithm
- data points
- precedence constraints
- finite number
- constant factor approximation