Graph clustering with a constraint on cluster sizes

A graph clustering problem (also known as the graph approximation problem) with a constraint on cluster sizes is studied. A new approximation algorithm is presented for this problem and performance guarantee of this algorithm is obtained. It is shown that the problem belongs to class $APX$ for every fixed $p$, where $p$ is the upper bound on the cluster sizes. Ill. 2, bibliogr. 20.