论文信息 - A 2-Approximation Algorithm for the Graph 2-Clustering Problem

A 2-Approximation Algorithm for the Graph 2-Clustering Problem

We study a version of the graph 2-clustering problem. In this version, for a given undirected graph, one has to find a nearest 2-cluster graph, i.e., the graph on the same vertex set with exactly 2 nonempty connected components each of which is a complete graph. The distance between two graphs is the number of noncoinciding edges.

Victor P. Il'ev | Svetlana Il'eva | Alexander Morshinin

[1] Avrim Blum,et al. Correlation Clustering , 2004, Machine Learning.

[2] James Saunderson,et al. A Local-Search 2-Approximation for 2-Correlation-Clustering , 2008, ESA.

[3] Roded Sharan,et al. Cluster graph modification problems , 2002, Discret. Appl. Math..

[4] Venkatesan Guruswami,et al. Correlation clustering with a fixed number of clusters , 2005, SODA '06.

[5] A. Ageev,et al. Computational complexity of the graph approximation problem , 2007 .