r-Gatherings on a Star
Let C be a set of n customers and F be a set of m facilities. An r-gather clustering of C is a partition of the points in clusters such that each cluster contains at least r points. The r-gather clustering problem asks to find an r-gather clustering which minimizes the maximum distance between any two points in a cluster. An r-gathering of C is an assignment of each customer \(c \in C\) to a facility \(f \in F\) such that each open facility has zero or at least r customers. The r-gathering problem asks to find an r-gathering that minimizes the maximum distance between a customer and its facility. In this work we consider the r-gather clustering and r-gathering problems when the customers and the facilities are lying on a “star”. We show that the r-gather clustering problem and the r-gathering problem with points on a star with d rays can be solved in \(O(rn+(r+1)^ddr)\) and \(O(n+r^2 m + d^2r^2 (d+\log m)+(r+1)^d2^d(r +d)d)\) time respectively.
Keywordsr-Gathering Clustering Facility location problem
We thank CodeCrafters International and Investortools, Inc. for supporting the first author under the grant “CodeCrafters-Investortools Research Grant”.
- 2.Aggarwal, G., et al.: Achieving anonymity via clustering. ACM Trans. Algorithms 6(3), 49:1–49:19 (2010)Google Scholar
- 7.Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 603–612 (2000)Google Scholar
- 8.Han, Y., Nakano, S.: On \(r\)-gatherings on the line. In: Proceedings of the FCS 2016, pp. 99–104 (2016)Google Scholar
- 9.Karget, D.R., Minkoff, M.: Building steiner trees with incomplete global knowledge. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 613–623 (2000)Google Scholar
- 11.Zeng, J., et al.: Mobile \(r\)-gather: distributed and geographic clustering for location anonymity. In: Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, Mobihoc 2017, pp. 7:1–7:10. ACM (2017)Google Scholar