A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
Crossref DOI link: https://doi.org/10.1134/S199047891602006X
Published Online: 2016-05-22
Published Print: 2016-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kel’manov, A. V.
Khamidullin, S. A.
Khandeev, V. I.
Text and Data Mining valid from 2016-04-01