Author:
Curticapean Radu,Künnemann Marvin
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference36 articles.
1. Anstee, R.P.: A polynomial algorithm for b-matchings: an alternative approach. Inf. Proc. Lett. 24(3), 153–157 (1987)
2. Arthur, D., Manthey, B., Röglin, H.: Smoothed analysis of the k-means method. J. ACM 58(5), 19:1–19:31 (2011)
3. Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035. SIAM (2007)
4. Arthur, D., Vassilvitskii, S.: Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method. SIAM J. Comput. 39(2), 766–782 (2009)
5. Avis, D.: A survey of heuristics for the weighted matching problem. Networks 13(4), 475–493 (1983)