Competitive Strategies for Online Clique Clustering

Marek Chrobak Christoph Dürr 1 Bengt Nilsson
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01206282
Contributor : Lip6 Publications <>
Submitted on : Monday, September 28, 2015 - 4:52:05 PM
Last modification on : Thursday, March 21, 2019 - 1:19:21 PM

Links full text

Identifiers

Citation

Marek Chrobak, Christoph Dürr, Bengt Nilsson. Competitive Strategies for Online Clique Clustering. The 9th International Conference on Algorithms and Complexity (CIAC), May 2015, Paris, France. pp.101-113, ⟨10.1007/978-3-319-18173-8_7⟩. ⟨hal-01206282⟩

Share

Metrics

Record views

64