• 综合
  • 标题
  • 关键词
  • 摘要
  • 学者
  • 期刊-刊名
  • 期刊-ISSN
  • 会议名称
搜索

作者:

Ji, Sai (Ji, Sai.) | Xu, Dachuan (Xu, Dachuan.) (学者:徐大川) | Li, Min (Li, Min.) | Wang, Yishui (Wang, Yishui.)

收录:

CPCI-S EI Scopus

摘要:

This paper considers the correlation clustering problem with non-uniform hard constrained cluster sizes, which is a generalization of correlation clustering problem. In this problem, we are given a positive integer U-upsilon for each vertex upsilon, and require vertical bar C vertical bar = min(upsilon is an element of C) U-upsilon for any cluster C. We provide a (2, 4)-bicriteria approximation algorithm for this problem. Namely, the solution returned by the algorithm has the cost that is at most 4 times the optimum, and for each cluster C in the solution, we have vertical bar C vertical bar <= 2min(upsilon is an element of C) U-upsilon.

关键词:

Non-uniform hard constrained cluster sizes Correlation clustering Approximation algorithm

作者机构:

  • [ 1 ] [Ji, Sai]Beijing Univ Technol, Dept Operat Res & Sci Comp, Beijing 100124, Peoples R China
  • [ 2 ] [Xu, Dachuan]Beijing Univ Technol, Dept Operat Res & Sci Comp, Beijing 100124, Peoples R China
  • [ 3 ] [Li, Min]Shandong Normal Univ, Sch Math & Stat, Jinan, Peoples R China
  • [ 4 ] [Wang, Yishui]Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China

通讯作者信息:

  • 徐大川

    [Xu, Dachuan]Beijing Univ Technol, Dept Operat Res & Sci Comp, Beijing 100124, Peoples R China

查看成果更多字段

相关关键词:

相关文章:

来源 :

ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2019

ISSN: 0302-9743

年份: 2019

卷: 11640

页码: 159-168

语种: 英文

被引次数:

WoS核心集被引频次: 0

SCOPUS被引频次: 1

ESI高被引论文在榜: 0 展开所有

万方被引频次:

中文被引频次:

近30日浏览量: 0

归属院系:

在线人数/总访问数:560/4983074
地址:北京工业大学图书馆(北京市朝阳区平乐园100号 邮编:100124) 联系我们:010-67392185
版权所有:北京工业大学图书馆 站点建设与维护:北京爱琴海乐之技术有限公司