Author:
Csirik János,Epstein Leah,Imreh Csanád,Levin Asaf
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Chan, T.M., Zarrabi-Zadeh, H.: A randomized algorithm for onine unit clustering. Theory of Computing Systems 45(3), 486–496 (2009)
2. Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. SIAM Journal on Computing 33(6), 1417–1440 (2004)
3. Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. Journal of Computer and System Sciences 68(2), 417–441 (2004)
4. Chin, F.Y.L., Ting, H.-F., Zhang, Y.: Variable-size rectangle covering. In: Proc. of the 3rd International Conference on Combinatorial Optimization and Applications (COCOA 2009), pp. 145–154 (2009)
5. Doddi, S., Marathe, M., Ravi, S.S., Taylor, D.S., Widmayer, P.: Approximation algorithms for clustering to minimize the sum of diameters. Nordic Journal of Computing 7(3), 185–203 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online Sum-Radii Clustering;Mathematical Foundations of Computer Science 2012;2012