An Approximation Algorithm for a Semi-supervised Graph Clustering Problem

An Approximation Algorithm for a Semi-supervised Graph Clustering Problem Full article

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.

Journal

Communications in Computer and Information Science
ISSN: 1865-0929

Output data

Year: 2020, Volume: 1275, Pages: 23-29 Pages count : 7 DOI: 10.1007/978-3-030-58657-7_3

Tags

Graph clustering, Approximation algorithm, Perfomance guarantee

Authors

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

Affiliations

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
In compilation 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
Elibrary:	45245996
OpenAlex:	W3085319379

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