Author:
Bereg Sergey,Bhattacharya Binay,Kirkpatrick David,Segal Michael
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference35 articles.
1. P.K. Agarwal, J. Gao and L.J. Guibas, Kinetic medians and kd-trees, in: Proc. 10th Annual European Symposium on Algorithms, LNCS 2461 (2002) pp. 5–16.
2. P. Agarwal, L. Guibas, J. Hershberger and E. Veach, Maintaining the extent of a moving point set, Discrete and Computational Geometry 26(3) (2001) 353–374.
3. P.K. Agarwal and S. Har-Peled, Maintaining the approximate extent measures of moving points, in: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms (2001) pp. 148–157.
4. P. Agarwal and M. Sharir, Planar geometric location problems, Algorithmica 11 (1994) 185–195.
5. S. Arora, P. Raghavan and S. Rao, Polynomial time approximation schemes for Euclidean k-medians and related problems, in: Proc. 31st ACM Symp. on Theory of Comput. (1998) pp. 106–113.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献