1. Du, W., Eppstein, D., Goodrich, M.T., Lueker, G.S.: On the approximability of geometric and geographic generalization and the min-max bin covering problem. In: WADS, pp. 242–253 (2009)
2. Ciriani, V., di Vimercati, S.D.C., Foresti, S., Samarati, P.: k-anonymous data mining: A survey. In: Aggarwal, C.C., Yu, P.S. (eds.) Privacy-Preserving Data Mining: Models and Algorithms, Springer, Heidelberg (2008)
3. Garcia, Y.J., Lopez, M.A., Leutenegger, S.T.: A greedy algorithm for bulk loading r-trees. In: GIS 1998: Proceedings of the 1998 ACM Int. Symp. on Advances in Geographic Information Systems, pp. 163–164. ACM, New York (1998)
4. Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5(4), 502–525 (1984)
5. Csirik, J., Johnson, D.S., Kenyon, C.: Better approximation algorithms for bin covering. In: SODA, pp. 557–566 (2001)