Approximation Algorithms For Stochastic Clustering

Authors:
David Harris University of Maryland
Shi Li University at Buffalo
Aravind Srinivasan University of Maryland College Park
Khoa Trinh
Thomas Pensyl

Introduction:

The authors consider stochastic settings for clustering, and develop provably-good (approximation) algorithms for a number of these notions.

Abstract:

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.

You may want to know: