Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2014: Computing and Combinatorics pp 276–287Cite as

On the Parameterized Complexity of Labelled Correlation Clustering Problem

  • Conference paper

  • 1291 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8591))

Abstract

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.

This work was supported in part by the National Grand Fundamental Research 973 Program of China under grant 2012CB316200, the Major Program of National Natural Science Foundation of China under grant 61190115, the Key Program of the National Natural Science Foundation of China under grant 61033015, 60933001, and the Shandong Provincial Natural Science Foundation of China under grant no. ZR2013FQ028.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1-3), 89–113 (2004)

    Article  MATH  Google Scholar 

  2. Chaudhuri, S., Ganti, V., Motwani, R.: Robust identification of fuzzy duplicates. In: ICDE, pp. 865–876 (2005)

    Google Scholar 

  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)

    Article  Google Scholar 

  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. Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. Journal of Computer and System Sciences 71(3), 360–383 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theoretical Computer Science 361(2), 172–187 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  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. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)

    Google Scholar 

  9. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)

    Google Scholar 

  10. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM Journal of Computing 24(4), 873–921 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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. 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)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  15. Hassin, R., Monnot, J., Segev, D.: Approximation algorithms and hardness results for labeled connectivity problems. Journal of Combinatorial Optimization 14, 437–453 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Broersma, H.J., Li, X., Woeginger, G., Zhang, S.G.: Paths and cycles in colored graphs. Australasian J. Combin. 31, 299–311 (2005)

    MATH  MathSciNet  Google Scholar 

  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. 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. 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)

    Article  MATH  MathSciNet  Google Scholar 

  20. Grohe, M.: Parameterized complexity for the database theorist. ACM SIGMOD Record 31(4), 86–96 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Harbin Institute of Technology, Harbin, Heilongjiang, China

    Xianmin Liu, Jianzhong Li & Hong Gao

Authors
  1. Xianmin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianzhong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Georgia State University, 34 Peachtree Street, Suite 1410, 30303, Atlanta, GA, USA

    Zhipeng Cai

  2. Department of Computer Science, Georgia State University, 34 Peachtree Street, Suite 1443, 30303, Atlanta, GA, USA

    Alex Zelikovsky

  3. Department of Computer Science, Georgia State University, 34 Peachtree Street, Suite 1449, 30303, Atlanta, GA, USA

    Anu Bourgeois

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, X., Li, J., Gao, H. (2014). On the Parameterized Complexity of Labelled Correlation Clustering Problem. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds) Computing and Combinatorics. COCOON 2014. Lecture Notes in Computer Science, vol 8591. Springer, Cham. https://doi.org/10.1007/978-3-319-08783-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08783-2_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08782-5

  • Online ISBN: 978-3-319-08783-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation