Author:
Saedi Samira,Kundakcioglu O. Erhun
Reference154 articles.
1. J. Abello, M.G.C. Resende, S. Sudarsky, Massive quasi-clique detection, in LATIN 2002: Theoretical Informatics (Springer, Berlin/New York, 2002), pp. 598–612
2. S. Alexe, E. Blackstone, P. Hammer, H. Ishwaran, M. Lauer, C. Snader, Coronary risk prediction by logical analysis of data. Ann. Oper. Res. 119, 15–42 (2003)
3. D. Aloise, A. Deshpande, P. Hansen, P. Popat, NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75, 245–248 (2009)
4. D. Arthur, S. Vassilvitskii, How slow is the k-means method? in Proceedings of the 22nd Annual Symposium on Computational Geometry (ACM, New York, 2006), pp. 144–153
5. B. Balasundaram, S. Butenko, I.V. Hicks, Clique relaxations in social network analysis: the maximum k-plex problem. Oper. Res. 59, 133–142 (2011)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献