Approximation algorithms for approximating graphs with bounded numberof connected components

The following graph approximation problem is studied: given an undirected graph, one has to find the nearest graph on the same vertex set all connected components of which are the complete graphs. The distance between graphs is equal to the number of noncoinciding edges. The brief survey of the known results is given. The constant-factor approximation algorithms for two versions of the graph approximation problem are proposed.