Grid based online algorithms for clustering problems


In this paper we consider the online variable sized clustering problem in d-dimensional Euclidean spaces where the cost of a cluster depends on the p-th power of its side. The previous results are extended from the model with square cost in 2-dimensional spaces. We determine the competitive ratio of the algorithm GRID in the general case. We show that it is… (More)


Cite this paper

@article{Divki2014GridBO, title={Grid based online algorithms for clustering problems}, author={Gabriella Div{\'e}ki and Csan{\'a}d Imreh}, journal={2014 IEEE 15th International Symposium on Computational Intelligence and Informatics (CINTI)}, year={2014}, pages={159-162} }