Author:
Du Hai,Xu Yinfeng,Zhu Binhai
Funder
National Natural Science Foundation of China (CN)
the PCSIRT of the Ministry of Education of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference24 articles.
1. Agarwal PK, Sharir M (1998) Efficient algorithms for geometric optimization. ACM Comput Surv 30:412–458
2. Bose P, Toussaint G (1996) Computing the constrained Euclidean, geodesic and link center of a simple polygon with applications, Proceedings of pacific graphics, International pp 102–112
3. Charikar M, Chekuri C, Feder T, Motwani R (1997) Incremental clustering and dynamic information retrieval, In: Proceedings 29th ACM Symposium on theory of computing (STOC97) pp 626–635
4. Charikar M, Panigrahy R (2004) Clustering to minimize the sum of cluster diameters. J Comput Syst Sci 68(2):417–441
5. Chrobak M, Hurand M (2011) Better bounds for incremental medians. Theor Comput Sci 412:594–601
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献