On the Parameterized Complexity of Labelled Correlation Clustering Problem

The Labelled Correlation Clustering problem, a variant of Correlation Clustering problem, is defined and studied in this paper. Since the problem is NP-complete, we consider the parameterized complexities. Three different parameterizations are considered, and the corresponding parameterized complexities are studied.

[1]  Avrim Blum,et al.  Correlation Clustering , 2004, Machine Learning.

[2]  Martin Grohe,et al.  Parameterized complexity for the database theorist , 2002, SGMD.

[3]  Rajeev Motwani,et al.  Robust identification of fuzzy duplicates , 2005, 21st International Conference on Data Engineering (ICDE'05).

[4]  Gerhard J. Woeginger,et al.  Paths and cycles in colored graphs , 2001, Australas. J Comb..

[5]  Venkatesan Guruswami,et al.  Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[6]  Gerhard J. Woeginger,et al.  Local search for the minimum label spanning tree problem with bounded color classes , 2003, Oper. Res. Lett..

[7]  Refael Hassin,et al.  Approximation algorithms and hardness results for labeled connectivity problems , 2007, J. Comb. Optim..

[8]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[9]  Nir Ailon,et al.  Aggregating inconsistent information: Ranking and clustering , 2008 .

[10]  Robert D. Carr,et al.  On the red-blue set cover problem , 2000, SODA '00.

[11]  Jin-Yi Cai,et al.  Approximation and hardness results for label cut and related problems , 2009, J. Comb. Optim..

[12]  Hwee Tou Ng,et al.  A Machine Learning Approach to Coreference Resolution of Noun Phrases , 2001, CL.

[13]  Dmitri V. Kalashnikov,et al.  Exploiting context analysis for combining multiple entity resolution systems , 2009, SIGMOD Conference.

[14]  Michael R. Fellows,et al.  Fixed-parameter tractability and completeness III: some structural aspects of the W hierarchy , 1993 .

[15]  Amos Fiat,et al.  Correlation clustering in general weighted graphs , 2006, Theor. Comput. Sci..

[16]  Michael R. Fellows,et al.  The parameterized complexity of some minimum label problems , 2009, J. Comput. Syst. Sci..

[17]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[18]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[19]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[20]  Somesh Jha,et al.  Two formal analyses of attack graphs , 2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15.