Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference27 articles.
1. Agarwal, P. K., & Sharathkumar, R. (2015). Streaming algorithms for extent problems in high dimensions. Algorithmica, 72(1), 83–98.
2. Bâdoiu, M., & Clarkson, KL. (2003). Smaller core-sets for balls. In Proceedings of the 14th annual ACM-SIAM symposium on discrete algorithms (pp. 801–802). SIAM, Philadelphia, PA, USA, SODA ’03.
3. Bâdoiu, M., Har-Peled, S., & Indyk, P. (2002). Approximate clustering via core-sets. In Proceedings of the 34th annual ACM symposium on theory of computing (pp. 250–257). ACM, New York, NY, USA, STOC ’02.
4. Chan, T. M., & Pathak, V. (2011). Streaming and dynamic algorithms for minimum enclosing balls in high dimensions (pp. 195–206). Berlin: Springer.
5. Dearing, P., & Zeck, C. R. (2009). A dual algorithm for the minimum covering ball problem in
$${\mathbb{R}}^n$$
R
n
. Operations Research Letters, 37(3), 171–175.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献