Algorithms and complexity results for labeled correlation clustering problem

DOI10.1007/s10878-013-9607-yzbMath1315.90058OpenAlexW1969272624MaRDI QIDQ2253964

Xianmin Liu, Jian-Zhong Li

Publication date: 16 February 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9607-y

zbMATH Keywords

algorithmcomputational complexitylabeled correlation clustering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Parameterized complexity of completeness reasoning for conjunctive queries, On the hardness of labeled correlation clustering problem: a parameterized complexity view

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation and hardness results for label cut and related problems
• Correlation clustering
• Local search for the minimum label spanning tree problem with bounded color classes.
• The parameterized complexity of some minimum label problems
• Approximation algorithms and hardness results for labeled connectivity problems
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• Aggregating inconsistent information