An Approximation Algorithm for a Semi-supervised Graph Clustering Problem | Sciact - Система учета научной деятельности ИМ СО РАН

An Approximation Algorithm for a Semi-supervised Graph Clustering Problem Научная публикация

Конференция

Mathematical Optimization Theory and Operations Research
06-10 июл. 2020 , Новосибирск

Сборник

International Conference on Mathematical Optimization Theory and Operations Research MOTOR 2020: Mathematical Optimization Theory and Operations Research
Сборник, 2020.

Журнал

Communications in Computer and Information Science
ISSN: 1865-0929

Вых. Данные

Год: 2020, Том: 1275, Страницы: 23-29 Страниц : 7 DOI: 10.1007/978-3-030-58657-7_3

Ключевые слова

Graph clustering, Approximation algorithm, Perfomance guarantee

Авторы

Il'ev Victor ^1,2 , Morshinin Alexander ²

Организации

1	Dostoevsky Omsk State Iniversity
2	Sobolev Institute of Mathematics SB RAS

Il'ev V. , Morshinin A.
An Approximation Algorithm for a Semi-supervised Graph Clustering Problem
В сборнике International Conference on Mathematical Optimization Theory and Operations Research MOTOR 2020: Mathematical Optimization Theory and Operations Research. 2020. – Т.1275. – C.23-29. DOI: 10.1007/978-3-030-58657-7_3 Scopus РИНЦ OpenAlex

Scopus:	2-s2.0-85092103369
РИНЦ:	45245996
OpenAlex:	W3085319379

Пока нет цитирований