A 2-Approximation Algorithm for the Graph 2-Clustering Problem Научная публикация
| Конференция |
18th International conference on mathematical optimization theory and operations research 08-12 июл. 2019 , Екатеринбург |
||||
|---|---|---|---|---|---|
| Сборник | Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings Сборник, Springer. 2019. 716 c. ISBN 978-3-030-22628-2. |
||||
| Журнал |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||
| Вых. Данные | Год: 2019, Том: 11558, Страницы: 295-308 Страниц : 14 DOI: 10.1007/978-3-030-22629-9_21 | ||||
| Ключевые слова | Graph clustering, Approximation algorithm, Perfomance guarantee | ||||
| Авторы |
|
||||
| Организации |
|
Библиографическая ссылка:
Il'ev V.
, Il’eva S.
, Morshinin A.
A 2-Approximation Algorithm for the Graph 2-Clustering Problem
В сборнике Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.295-308. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_21 Scopus РИНЦ OpenAlex
A 2-Approximation Algorithm for the Graph 2-Clustering Problem
В сборнике Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.295-308. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_21 Scopus РИНЦ OpenAlex
Даты:
| Опубликована online: | 12 июн. 2019 г. |
Идентификаторы БД:
| Scopus: | 2-s2.0-85067669755 |
| РИНЦ: | 45221589 |
| OpenAlex: | W2949146652 |