On the Parameterized Complexity of Labelled Correlation Clustering Problem

  • Xianmin Liu
  • Jianzhong Li
  • Hong Gao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8591)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1-3), 89–113 (2004)CrossRefzbMATHGoogle Scholar
  2. 2.
    Chaudhuri, S., Ganti, V., Motwani, R.: Robust identification of fuzzy duplicates. In: ICDE, pp. 865–876 (2005)Google Scholar
  3. 3.
    Soon, W.M., Ng, H.T., Lim, D.C.Y.: A machine learning approach to coreference resolution of noun phrases. Computational Linguistics 27(4), 521–544 (2001)CrossRefGoogle Scholar
  4. 4.
    Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. Journal of ACM 55(5), 23:1–23:27 (2008)Google Scholar
  5. 5.
    Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. Journal of Computer and System Sciences 71(3), 360–383 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theoretical Computer Science 361(2), 172–187 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Chen, Z., Kalashnikov, D.V., Mehrotra, S.: Exploiting context analysis for combining multiple entity resolution systems. In: SIGMOD, pp. 207–218 (2009)Google Scholar
  8. 8.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)Google Scholar
  9. 9.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)Google Scholar
  10. 10.
    Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM Journal of Computing 24(4), 873–921 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science 141(1&2), 109–131 (1995)Google Scholar
  12. 12.
    Downey, R., Fellows, M.: Fixed-parameter tractability and completeness III: Some structural aspects of the W hierarchy. In: Complexity Theory: Current Research – Proceedings of the 1992 Dagstuhl Workshop on Structural Complexity, pp. 191–225 (1993)Google Scholar
  13. 13.
    Fellows, M.R., Guo, J., Kanj, I.: The parameterized complexity of some minimum label problems. Journal of Computer and System Sciences 76, 727–740 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    BrüGgemann, T., Monnot, J., Woeginger, G.J.: Local search for the minimum label spanning tree problem with bounded color classes. Operations Research Letters 31(3), 195–201 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Hassin, R., Monnot, J., Segev, D.: Approximation algorithms and hardness results for labeled connectivity problems. Journal of Combinatorial Optimization 14, 437–453 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Broersma, H.J., Li, X., Woeginger, G., Zhang, S.G.: Paths and cycles in colored graphs. Australasian J. Combin. 31, 299–311 (2005)zbMATHMathSciNetGoogle Scholar
  17. 17.
    Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: SODA, pp. 345–353 (2000)Google Scholar
  18. 18.
    Jha, S., Sheyner, O., Wing, J.: Two formal analys s of attack graphs. In: Proceedings of the 15th IEEE Workshop on Computer Security Foundations, pp. 49–63 (2002)Google Scholar
  19. 19.
    Zhang, P., Cai, J.-Y., Tang, L.-Q., Zhao, W.-B.: Approximation and hardness results for label cut and related problems. Journal of Combinatorial Optimization 21, 192–208 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Grohe, M.: Parameterized complexity for the database theorist. ACM SIGMOD Record 31(4), 86–96 (2002)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Xianmin Liu
    • 1
  • Jianzhong Li
    • 1
  • Hong Gao
    • 1
  1. 1.Harbin Institute of TechnologyHarbinChina

Personalised recommendations