Subject
Information Systems and Management
Reference24 articles.
1. Efficient algorithms for geometric optimization;Agarwal;ACM Computing Surveys,1998
2. T. Asano, B. Bhattacharya, M. Keil, F. Yao, Clustering algorithms based on minimum and maximum spanning trees, in: Proceedings of the 4th Annual Symposium on Computational Geometry, 1988, pp. 252–257.
3. Approximate of n-dimensional data using spherical and ellipsoidal primitives;Calafiore;IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans,2002
4. Geometric clustering;Capoyleas;Journal of Algorithms,1991
5. Las Vegas algorithms for linear and integer programming when the dimension is small;Clarkson;Journal of the ACM,1995
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献