%0 Journal Article
%T Algorithms for Cluster Editing:A Survey<br>簇图编辑问题的研究进展
%A WANG Jian-xin
%A WAN Mao-wu
%A CHEN Jian-er
%A <br>王建新
%A 万茂武
%A 陈建二
%J 计算机科学
%D 2010
%I 
%X The Cluster Editing is known to be a very important NP-hard problem. As a special case of Correlation Clustering, it plays a significant role on many fields such as computation biology. After the theory of parameterized complexity was brought up, its parameterized version has drawn much attention. We introduced some approximation and parameterized algorithms for this problem and some variants of it, emphasized on the latest results about its kernelization and FPT algorithms. At the end, we presented some further directions for future research.
%K Cluster editing
%K Clustering
%K NP-hard
%K Approximation algorithms
%K Paramctcrizcd algorithms<br>簇图编辑问题，聚类问题，NP-难，近似算法，参数算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=CE272602ACD5B82AABDF1EB9F8F07A39&yid=140ECF96957D60B2&vid=42425781F0B1C26E&iid=59906B3B2830C2C5&sid=5D311CA918CA9A03&eid=708DD6B15D2464E8&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0