Competitive Strategies for Online Clique Clustering
A clique clustering of a graph is a partitioning of its vertices into disjoint cliques. The quality of a clique clustering is measured by the total number of edges in its cliques. We consider the online variant of the clique clustering problem, where the vertices of the input graph arrive one at a time. At each step, the newly arrived vertex forms a singleton clique, and the algorithm can merge any existing cliques in its partitioning into larger cliques, but splitting cliques is not allowed. We give an online strategy with competitive ratio \(15.645\) and we prove a lower bound of \(6\) on the competitive ratio, improving the previous respective bounds of \(31\) and \(2\).
Unable to display preview. Download preview PDF.
- 3.Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)Google Scholar
- 5.Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, trees, and minimum latency tours. In: 44th Symposium on Foundations of Computer Science (FOCS 2003), Proceedings, Cambridge, MA, USA, October 11–14, pp. 36–45 (2003)Google Scholar
- 10.Fabijan, A., Nilsson, B.J., Persson, M.: Competitive online clique clustering. In: Proc. 8th International Conference on Algorithms and Complexity (CIAC 2013), pp. 221–233 (2013)Google Scholar
- 13.Mathieu, C., Sankur, O., Schudy, W.: Online correlation clustering. In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), pp. 573–584 (2010)Google Scholar
- 14.Valinsky, L., Vedova, G.D., Scupham, R.J., Alvey, S., Figueroa, A., Yin, B., Jack Hartin, R., Chrobak, M., Crowley, D.E., Jiang, T., Borneman, J.: Analysis of bacterial community composition by oligonucleotide fingerprinting of rRNA genes. Applied and Environmental Microbiology 68, 2002 (2002)Google Scholar