Geodesic
Graph clustering with a~constraint on cluster sizes
Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 3, pp. 5-20

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: clustering, approximation, graph, approximation algorithm, performance guarantee. 
@article{DA_2016_23_3_a0,
     author = {V. P. Il'ev and S. D. Il'eva and A. A. Navrotskaya},
     title = {Graph clustering with a~constraint on cluster sizes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {5--20},
     publisher = {mathdoc},
     volume = {23},
     number = {3},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2016_23_3_a0/}
}
TY  - JOUR
AU  - V. P. Il'ev
AU  - S. D. Il'eva
AU  - A. A. Navrotskaya
TI  - Graph clustering with a~constraint on cluster sizes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2016
SP  - 5
EP  - 20
VL  - 23
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2016_23_3_a0/
LA  - ru
ID  - DA_2016_23_3_a0
ER  - 
%0 Journal Article
%A V. P. Il'ev
%A S. D. Il'eva
%A A. A. Navrotskaya
%T Graph clustering with a~constraint on cluster sizes
%J Diskretnyj analiz i issledovanie operacij
%D 2016
%P 5-20
%V 23
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2016_23_3_a0/
%G ru
%F DA_2016_23_3_a0
V. P. Il'ev; S. D. Il'eva; A. A. Navrotskaya. Graph clustering with a~constraint on cluster sizes. Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 3, pp. 5-20. http://geodesic.mathdoc.fr/item/DA_2016_23_3_a0/