On the asymptotic optimality of a solution of the euclidean problem of covering a graph by m nonadjacent cycles of maximum total weight
Crossref DOI link: https://doi.org/10.1134/S1064562416010233
Published Online: 2016-03-31
Published Print: 2016-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Gimadi, E. Kh.
Rykov, I. A.
Text and Data Mining valid from 2016-01-01
