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 to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1-3), 89–113 (2004)
Chaudhuri, S., Ganti, V., Motwani, R.: Robust identification of fuzzy duplicates. In: ICDE, pp. 865–876 (2005)
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)
Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. Journal of ACM 55(5), 23:1–23:27 (2008)
Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. Journal of Computer and System Sciences 71(3), 360–383 (2005)
Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theoretical Computer Science 361(2), 172–187 (2006)
Chen, Z., Kalashnikov, D.V., Mehrotra, S.: Exploiting context analysis for combining multiple entity resolution systems. In: SIGMOD, pp. 207–218 (2009)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM Journal of Computing 24(4), 873–921 (1995)
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)
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)
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)
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)
Hassin, R., Monnot, J., Segev, D.: Approximation algorithms and hardness results for labeled connectivity problems. Journal of Combinatorial Optimization 14, 437–453 (2007)
Broersma, H.J., Li, X., Woeginger, G., Zhang, S.G.: Paths and cycles in colored graphs. Australasian J. Combin. 31, 299–311 (2005)
Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: SODA, pp. 345–353 (2000)
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)
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)
Grohe, M.: Parameterized complexity for the database theorist. ACM SIGMOD Record 31(4), 86–96 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)