Tight Coreset Bounds for -Clustering in Euclidean and Doubling MetricsResearch Paper
A coreset compresses a clustering dataset into a weighted subset whose cost approximates the original cost for every permitted choice of centers. An optimization algorithm can work on that subset after the input has been read. The number of retained locations therefore matters independently of the time needed to inspect the original data. The question here…