电邮这篇文章 Graph clustering with a constraint on cluster sizes
- 作者: Il’ev V.P.1,2, Il’eva S.D.2, Navrotskaya A.A.1,2
-
隶属关系:
- Sobolev Institute of Mathematics
- Dostoevsky Omsk State University
- 期: 卷 10, 编号 3 (2016)
- 页面: 341-348
- 栏目: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212403
- DOI: https://doi.org/10.1134/S1990478916030042
- ID: 212403
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
A graph clustering problem is under study (also known as the graph approximation problem) with a constraint on cluster sizes. Some new approximation algorithm is presented for this problem, and performance guarantee of the algorithm is obtained. It is shown that the problem belongs to the class APX for every fixed p, where p is the upper bound on the cluster sizes.
作者简介
V. Il’ev
Sobolev Institute of Mathematics; Dostoevsky Omsk State University
编辑信件的主要联系方式.
Email: iljev@mail.ru
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090; pr. Mira 55-A, Omsk, 644077
S. Il’eva
Dostoevsky Omsk State University
Email: iljev@mail.ru
俄罗斯联邦, pr. Mira 55-A, Omsk, 644077
A. Navrotskaya
Sobolev Institute of Mathematics; Dostoevsky Omsk State University
Email: iljev@mail.ru
俄罗斯联邦, pr. Akad. Koptyuga 4, Novosibirsk, 630090; pr. Mira 55-A, Omsk, 644077
补充文件
