1. Agarwal, P.K., Erickson, J.: Geometric Range Searching and its Relatives. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, pp. 1–56 (1998)
2. Ahuja, P.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
3. Arthur, D., Vassilvitskii, S.: K-means++: the Advantages of Careful Seeding. In: Proc. of the 18th Annual ACM-SIAM Sym. of Desc. Alg., pp. 1027–1035 (2007)
4. Chazelle, B., Welzl, E.: Quasi-optimal Range Searching in Spaces of Finite VC-dimension. Arch. Rat. Mech. Anal. 4, 467–490 (1989)
5. Ahuja, P.K., Magnanti, T.L., Orlin, J.B.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)