1. Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Garcia-Molina H, Jagadish HV (eds) Proceedings of the ACM SIGMOD international conference on management of data. Atlantic City, NJ, May 1990, pp 322–331
2. Berg M, Kreveld M, Overmars M, Schwarzkopf O (eds) (2000) Computational geometry: algorithms and applications. Springer, Berlin
3. Cabello S, Diaz-Banex JM, Langerman S, Seara C (2010) Facility location problems in the plane based on reverse nearest neighbor queries. Eur J Oper Res 202(1):99–106
4. Cabello S, Diaz-Banez JM, Langerman S, Seara C, Ventura I (2005) Reverse facility location problems. In: Proceedings of the 17th Canadian conference on computational geometry, Ontario, Canada, Aug 2005, pp 68–71
5. Cardinal J, Langerman S (2006) Min-max-min geometric facility location problems. In: Proceedings of the 22nd European workshop on computational geometry, Delphi, Greece, March 2006