@article{PDM_2011_3_a5,
     author = {V. P. Il'ev and A. A. Navrocka},
     title = {Computational complexity of the problem of approximation by graphs with connected components of bounded size},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {80--84},
     publisher = {mathdoc},
     number = {3},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_3_a5/}
}