An Approximation Algorithm for a Semi-Supervised Graph Clustering Problem

An Approximation Algorithm for a Semi-Supervised Graph Clustering Problem Conference Abstracts

Conference

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

Source

International Conference on Mathematical Optimization Theory and Operations Research MOTOR 2020: Mathematical Optimization Theory and Operations Research
Compilation, 2020.

Output data

Year: 2020, Pages: 23-29 Pages count : 7

Authors

Ilʹev Viktor Petrovich ^1,2 , Il’eva Svetlana ² , Morshinin Aleksandr Vladimirovich ¹

Affiliations

1	Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН».
2	Dostoevsky Omsk State University

Ilʹev V.P. , Il’eva S. , Morshinin A.V.
An Approximation Algorithm for a Semi-Supervised Graph Clustering Problem
In compilation International Conference on Mathematical Optimization Theory and Operations Research MOTOR 2020: Mathematical Optimization Theory and Operations Research. 2020. – Т.1275. – C.23-29.

No identifiers

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