2-Approximation Algorithms for Two Graph Clustering Problems

2-Approximation Algorithms for Two Graph Clustering Problems Full article

Journal

Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797

Output data

Year: 2020, Number: 14, Pages: 490-502 Pages count : 13 DOI: 10.1134/S1990478920030084

Tags

graph, clustering, NP-hard problem, approximation algorithm, perfomance guarantee

Authors

Il'ev V.P. ^1,2 , Morshinin A.V. ² , Ileva S.D. ¹

Affiliations

1	Dostoevsky Omsk State University
2	Omsk Branch of Sobolev Institute of Mathematics

Il'ev V.P. , Morshinin A.V. , Ileva S.D.
2-Approximation Algorithms for Two Graph Clustering Problems
Journal of Applied and Industrial Mathematics. 2020. N14. P.490-502. DOI: 10.1134/S1990478920030084 Scopus OpenAlex

Submitted:	Jan 10, 2020
Accepted:	May 25, 2020

Scopus:	2-s2.0-85094631947
OpenAlex:	W3096285426

DB	Citing
OpenAlex	2
Scopus	1