Abstract
We study a version of the graph \(2\)-clustering problem and the related semi-supervised problem. In these problems, given an undirected graph, we have to find a nearest \(2 \)-cluster graph, i.e. a graph on the same vertex set with exactly two nonempty connected components each of which is a complete graph. The distance between two graphs is the number of noncoinciding edges. The problems under consideration are NP-hard. In 2008, Coleman, Saunderson, and Wirth presented a polynomial time \(2 \)-approximation algorithm for the analogous problem in which the number of clusters does not exceed \(2\). Unfortunately, the method of proving the performance guarantee of the Coleman, Saunderson, and Wirth algorithm is inappropriate for the graph \(2\)-clustering problem in which the number of clusters equals \(2\). We propose a polynomial time \(2 \)-approximation algorithm for the \(2 \)-clustering problem on an arbitrary graph. In contrast to the proof by Coleman, Saunderson, and Wirth, our proof of the performance guarantee of this algorithm does not use switchings. Moreover, we propose an analogous \(2 \)-approximation algorithm for the related semi-supervised problem.
This is a preview of subscription content, log in via an institution to check access.
REFERENCES
N. Bansal, A. Blum, and S. Chawla, “Correlation Clustering,” Mach. Learn.56 (1–3), 89–113 (2004).
T. Coleman, J. Saunderson, and A. Wirth, “A Local-Search \(2 \)-Approximation for \(2 \)-Correlation-Clustering,” in Algorithms—ESA 2008. Proceedings of 16th Annual European Symposium (Karlsruhe, Germany, September 15–17, 2008) (Springer, Heidelberg, 2008), pp. 308–319 [Lecture Notes in Computer Science, Vol. 5193].
R. Shamir, R. Sharan, and D. Tsur, “Cluster Graph Modification Problems,” Discrete Appl. Math. 144 (1–2), 173–182 (2004).
C. T. Zahn, “Approximating Symmetric Relations by Equivalence Relations,” J. Soc. Ind. Appl. Math. 12 (4), 840–847 (1964).
V. P. Il’ev and G. Sh. Fridman, “On the Problem of Approximation by Graphs with a Fixed Number of Components,” Dokl. Akad. Nauk SSSR 264 (3), 533–538 (1982) [Soviet Math. Dokl. 25 (3), 666–670 (1982)].
A. A. Ageev, V. P. Il’ev, A. V. Kononov, and A. S. Talevnin, “Computational Complexity of the Graph Approximation Problem,” Diskret. Anal. Issled. Oper. Ser. 1,13 (1), 3–11 (2006) [J. Appl. Ind. Math. 1 (1), 1–8 (2007)].
I. Giotis and V. Guruswami, “Correlation Clustering with a Fixed Number of Clusters,” Theory Comput. 2 (1), 249–266 (2006).
O. Chapelle, B. Schölkopf, and A. Zein, Semi-Supervised Learning (MIT Press, Cambridge, MA, 2006).
E. Bair, “Semi-Supervised Clustering Methods,” Wiley Interdisciplinary Reviews: Computational Statistics 5 (5), 349–361 (2013).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by Ya.A. Kopylov
Rights and permissions
About this article
Cite this article
Il’ev, V.P., Il’eva, S.D. & Morshinin, A.V. 2-Approximation Algorithms for Two Graph Clustering Problems. J. Appl. Ind. Math. 14, 490–502 (2020). https://doi.org/10.1134/S1990478920030084
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478920030084