$2$-Approximation algorithms for two graph clustering problems

2020 ◽  
Vol 27 (3) ◽  
pp. 88-108
Author(s):  
V. P. Il'ev ◽  
S. D. Il'eva ◽  
A. V. Morshinin
2020 ◽  
Vol 14 (3) ◽  
pp. 490-502
Author(s):  
V. P. Il’ev ◽  
S. D. Il’eva ◽  
A. V. Morshinin

2007 ◽  
Vol 18 (02) ◽  
pp. 217-226 ◽  
Author(s):  
ANDERS DESSMARK ◽  
JESPER JANSSON ◽  
ANDRZEJ LINGAS ◽  
EVA-MARTA LUNDELL ◽  
MIA PERSSON

We consider the following clustering problems: given an undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number of edges within the clusters is maximized (Max-ECP), or the number of edges between clusters is minimized (Min-ECP). These problems arise naturally in the DNA clone classification. We investigate the hardness of finding such partitions and provide approximation algorithms. Further, we show that greedy strategies yield constant factor approximations for graph classes for which maximum cliques can be found efficiently.


2004 ◽  
Vol 2 (2) ◽  
pp. 289-301 ◽  
Author(s):  
Leszek Ga̧sieniec ◽  
Jesper Jansson ◽  
Andrzej Lingas

2015 ◽  
Vol 32 (4) ◽  
pp. 518-522 ◽  
Author(s):  
Sarah Bastkowski ◽  
Vincent Moulton ◽  
Andreas Spillner ◽  
Taoyang Wu

Sign in / Sign up

Export Citation Format

Share Document