An FPT Algorithm for the Correlation Clustering Problem
2011 ◽
Vol 474-476
◽
pp. 924-927
◽
Keyword(s):
Given an undirected graph G=(V, E) with real nonnegative weights and + or – labels on its edges, the correlation clustering problem is to partition the vertices of G into clusters to minimize the total weight of cut + edges and uncut – edges. This problem is APX-hard and has been intensively studied mainly from the viewpoint of polynomial time approximation algorithms. By way of contrast, a fixed-parameter tractable algorithm is presented that takes treewidth as the parameter, with a running time that is linear in the number of vertices of G.
2019 ◽
Vol 35
(1)
◽
pp. 57-68
2013 ◽
pp. 132-143
2016 ◽
Vol 33
(3)
◽
pp. 809-813
◽
2002 ◽
Vol 13
(04)
◽
pp. 613-627
◽
2005 ◽
pp. 462-475
◽
1993 ◽
Vol 04
(02)
◽
pp. 117-133
1999 ◽
Vol 2
(5)
◽
pp. 203-213
◽