Abstract
Online clustering problems are problems where the classification of points into sets (called clusters) is performed in an online fashion. Points arrive at arbitrary locations, one by one, to be assigned to clusters at the time of arrival. A point can be either assigned to an existing cluster or a new cluster can be opened for it. Here, we study a one-dimensional variant on a line. Each cluster is a closed interval, and there is no restriction on the length of a cluster. The cost of a cluster is the sum of a fixed set-up cost and its diameter (or length). The goal is to minimize the sum of costs of the clusters used by the algorithm.
We study several variants, each having the two essential properties that a point which has been assigned to a given cluster must remain assigned to that cluster and no pair of clusters can 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 but the exact location can be modified. Here we give tight bounds on the competitive ratio of any online algorithm in each of these variants. In addition, for each model we also consider the semi-online case where points are presented ordered by their location.
Similar content being viewed by others
References
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Chan, T.M., Zarrabi-Zadeh, H.: A randomized algorithm for online unit clustering. Theory Comput. Syst. 45(3), 486–496 (2009)
Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. SIAM J. Comput. 33(6), 1417–1440 (2004)
Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. J. Comput. Syst. Sci. 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 (COCOA2009), 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. Nord. J. Comput. 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 (SWAT2010), pp. 371–382 (2010)
Epstein, L., Levin, A., van Stee, R.: Online unit clustering: Variations on a theme. Theor. Comput. Sci. 407(1–3), 85–96 (2008)
Epstein, L., van Stee, R.: On the online unit clustering problem. ACM Trans. Algorithms 7(1), Article 7 (2010), 18 pages
Fotakis, D.: Incremental algorithms for facility location and k-median. Theor. Comput. Sci. 361(2–3), 275–313 (2006)
Fotakis, D.: Memoryless facility location in one pass. In: Proc. of the 23rd Symposium on Theoretical Aspects of Computer Science (STACS2006), pp. 608–620 (2006)
Fotakis, D.: A primal-dual algorithm for online non-uniform facility location. J. 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 J. Algebr. Discrete Methods 6(4), 721–730 (1985)
Kolen, A., Tamir, A.: Covering problems. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory, pp. 263–304. Wiley, New York (1990), Chap. 6
Levin, A.: A generalized minimum cost k-clustering. ACM Trans. Algorithms 5(4), Article 36 (2009), 10 pages
Meyerson, A.: Online facility location. In: Proc. of the 42nd Annual Symposium on Foundations of Computer Science (FOCS2001), 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 the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2002), pp. 108–115 (2002)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
Tamir, A.: Maximum coverage with balls of different radii. Manuscript (2 pages) (2003)
Zarrabi-Zadeh, H., Chan, T.M.: An improved algorithm for online unit clustering. Algorithmica 54(4), 490–500 (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
This study was 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.
An extended abstract of this paper appears in the Proceedings of MFCS 2010, pages 282–293.
Rights and permissions
About this article
Cite this article
Csirik, J., Epstein, L., Imreh, C. et al. Online Clustering with Variable Sized Clusters. Algorithmica 65, 251–274 (2013). https://doi.org/10.1007/s00453-011-9586-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-011-9586-2