Algorithms and complexity results for labeled correlation clustering problem

Xianmin Liu () and Jianzhong Li ()
Additional contact information
Xianmin Liu: Harbin Institute of Technology
Jianzhong Li: Harbin Institute of Technology

Journal of Combinatorial Optimization, 2015, vol. 29, issue 2, No 10, 488-501

Abstract: Abstract The Labeled Correlation Clustering problem, a variant of Correlation Clustering problem, is defined and studied in this paper. It is shown that the problem is NP-complete, and an approximation algorithm is given. For the case when a parameter is fixed, a better approximation algorithm is proposed, and, for a simple fragment of that problem, a PTime algorithm is introduced.

Keywords: Labeled correlation clustering; Algorithm; Computational complexity (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9607-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:2:d:10.1007_s10878-013-9607-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9607-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().