The $r$-Gather Problem in Euclidean Space
暂无分享,去创建一个
[1] Uri Zwick,et al. Efficient algorithms for the 2-gathering problem , 2010, TALG.
[2] Latanya Sweeney,et al. k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..
[3] Samir Khuller,et al. Achieving anonymity via clustering , 2006, PODS '06.
[4] Amitai Armon,et al. On Min-Max r -Gatherings , 2007, WAOA.
[5] Elliot Anshelevich,et al. Terminal Backup, 3D Matching, and Covering Cubic Graphs , 2011, SIAM J. Comput..