Author:
Bespamyatnikh Sergei,Segal Michael
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. P. Agarwal, B. Aronov, M. Sharir, S. Suri, “Selecting distances in the plane”, Algorithmica, 9, pp. 495–514, 1993.
2. P. Agarwal, M. Sharir, E. Welzl “The discrete 2-center problem”, Proc. 13th ACM Symp. on Computational Geometry, pp. 147–155, 1997.
3. P.K. Agarwal and C.M. Procopiuc, “Exact and Approximation Algorithms for Clustering”, in Proc. SODA’98, pp. 658–667, 1998.
4. S. Arya and D. Mount, “Approximate range searching”, in Proc. 11th ACM Symp. on Comp. Geom., pp. 172–181, 1995.
5. J. Bentley, “Decomposable searching problems”, Inform. Process. Lett., 8, pp. 244–251, 1979.