Fitting Data on a Grain of Rice

Coresets are among the most successful compression paradigms. For clustering, a coreset B of a point set A preserves the clustering cost for any candidate solution C. In general, we are interested in finding a B that is as small as possible. In this overview, we will survey techniques for constructing coresets for clustering problems, their applications, and potential future directions.