An Improved Algorithm for Online Unit Clustering
We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA’06: given a sequence of n points on the line, the objective is to partition the points into a minimum number of subsets, each enclosable by a unit interval. We present a new randomized online algorithm that achieves expected competitive ratio 11/6 against oblivious adversaries, improving the previous ratio of 15/8. This immediately leads to improved upper bounds for the problem in two and higher dimensions as well.
KeywordsGrid Cell Facility Location Competitive Ratio Improve Algorithm Combine Algorithm
Unable to display preview. Download preview PDF.
- 4.Fotakis, D.: Incremental algorithms for facility location and k-median. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 347–358. Springer, Heidelberg (2004)Google Scholar
- 10.Meyerson, A.: Online facility location. In: Proc. 42nd IEEE Sympos. Found. Comput. Sci., pp. 426–433 (2001)Google Scholar
- 12.Tanimoto, S.L., Fowler, R.J.: Covering image subsets with patches. In: Proc. 5th International Conf. on Pattern Recognition, pp. 835–839 (1980)Google Scholar