Approximation algorithms for stochastic clustering

09/07/2018
by   David G. Harris, et al.
0

We consider stochastic settings for clustering, and develop provably-good (approximation) algorithms for a number of these notions. These algorithms allow one to obtain better approximation ratios compared to the usual deterministic clustering setting. Additionally, they offer a number of advantages including providing fairer clustering and clustering which has better long-term behavior for each user. In particular, they ensure that *every user* is guaranteed to get good service (on average). We also complement some of these with impossibility results.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset