Approximation algorithms for stochastic clustering.
David G. HarrisShi LiAravind SrinivasanKhoa TrinhThomas W. PensylPublished in: NeurIPS (2018)
Keyphrases
- data points
- approximation algorithms
- np hard
- special case
- approximation schemes
- worst case
- facility location problem
- vertex cover
- exact algorithms
- primal dual
- minimum cost
- set cover
- network design problem
- randomized algorithms
- np hardness
- constant factor
- k means
- open shop
- approximation ratio
- precedence constraints
- integer programming
- branch and bound algorithm
- information theoretic
- clustering algorithm
- disjoint paths