MIT; Google Research
Vincent Cohen-Addad, Alessandro Epasto, Vahab Mirrokni, Shyam Narayanan, Peilin Zhong
differential privacy;clustering;massively parallel computation;approximation algorithms
Near-Optimal Private and Scalable $k$-Clustering