TY - JOUR AU - V. P. Il'ev AU - A. A. Navrocka TI - Computational complexity of the problem of approximation by graphs with connected components of bounded size JO - Prikladnaâ diskretnaâ matematika PY - 2011 SP - 80 EP - 84 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/PDM_2011_3_a5/ LA - ru ID - PDM_2011_3_a5 ER -