Abstract
In online clustering problems, the classification of points into sets (called clusters) is done in an online fashion. Points arrive one by one at arbitrary locations, to be assigned to clusters at the time of arrival. A point can be assigned to an existing cluster, or a new cluster can be opened for it. We study a one dimensional variant on a line, where there is no restriction on the length of a cluster, and the cost of a cluster is the sum of a fixed set-up cost and its diameter. The goal is to minimize the sum of costs of the clusters used by the algorithm.
We study several variants, all maintaining the essential property that a point which was assigned to a given cluster must remain assigned to this cluster, and clusters cannot be merged. In the strict variant, the diameter and the exact location of the cluster must be fixed when it is initialized. In the flexible variant, the algorithm can shift the cluster or expand it, as long as it contains all points assigned to it. In an intermediate model, the diameter is fixed in advance while the exact location can be modified. We give tight bounds on the competitive ratio of any online algorithm in each of these variants. In addition, for each one of the models, we consider also the semi-online case, where points are presented sorted by their location.
This research has been partially supported by the TÁMOP-4.2.2/08/1/2008-0008 program of the Hungarian National Development Agency. Cs. Imreh was supported by the Bolyai Scholarship of the Hungarian Academy of Sciences.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chan, T.M., Zarrabi-Zadeh, H.: A randomized algorithm for onine unit clustering. Theory of Computing Systems 45(3), 486–496 (2009)
Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. SIAM Journal on Computing 33(6), 1417–1440 (2004)
Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. Journal of Computer and System Sciences 68(2), 417–441 (2004)
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)
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)
Ehmsen, M.R., Larsen, K.S.: Better bounds on online unit clustering. In: Proc. of the 12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010 (to appear 2010)
Epstein, L., Levin, A., van Stee, R.: Online unit clustering: Variations on a theme. Theoretical Computer Science 407(1-3), 85–96 (2008)
Epstein, L., van Stee, R.: On the online unit clustering problem. ACM Transactions on Algorithms (to appear)
Fotakis, D.: Incremental algorithms for facility location and k-median. Theoretical Computer Science 361(2-3), 275–313 (2006)
Fotakis, D.: Memoryless facility location in one pass. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 608–620. Springer, Heidelberg (2006)
Fotakis, D.: A primal-dual algorithm for online non-uniform facility location. Journal of Discrete Algorithms 5(1), 141–148 (2007)
Fotakis, D.: On the competitive ratio for online facility location. Algorithmica 50(1), 1–57 (2008)
Hoffman, A.J., Kolen, A., Sakarovitch, M.: Totally balanced and greedy matrices. SIAM Journal on Algebraic and Discrete Methods 6, 721–730 (1985)
Kolen, A., Tamir, A.: Covering problems. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory, ch. 6, pp. 263–304. Wiley, Chichester (1990)
Levin, A.: A generalized minimum cost k-clustering. ACM Transactions on Algorithms 5(4) (2009)
Meyerson, A.: Online facility location. In: Annual Symposium on Foundations of Computer Science (FOCS 2001), pp. 426–431 (2001)
Shah, R., Farach-Colton, M.: Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. In: Proc. of 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 108–115 (2002)
Tamir, A.: Maximum coverage with balls of different radii (2003) (mansucript)
Zarrabi-Zadeh, H., Chan, T.M.: An improved algorithm for online unit clustering. Algorithmica 54(4), 490–500 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Csirik, J., Epstein, L., Imreh, C., Levin, A. (2010). Online Clustering with Variable Sized Clusters. In: Hliněný, P., Kučera, A. (eds) Mathematical Foundations of Computer Science 2010. MFCS 2010. Lecture Notes in Computer Science, vol 6281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15155-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-15155-2_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15154-5
Online ISBN: 978-3-642-15155-2
eBook Packages: Computer ScienceComputer Science (R0)