A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem Научная публикация
| Журнал |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2016, Страницы: 182-192 Страниц : 11 DOI: 10.1007/978-3-319-44914-2_15 | ||||
| Авторы |
|
||||
| Организации |
|
Библиографическая ссылка:
Kel’manov A.
, Motkova A.
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem
Lecture Notes in Computer Science. 2016. P.182-192. DOI: 10.1007/978-3-319-44914-2_15 Scopus OpenAlex
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem
Lecture Notes in Computer Science. 2016. P.182-192. DOI: 10.1007/978-3-319-44914-2_15 Scopus OpenAlex
Идентификаторы БД:
| Scopus: | 2-s2.0-84988037221 |
| OpenAlex: | W2559584927 |