Approximation Algorithms for the Capacitated Min-Max Correlation Clustering Problem

被引：0

作者：

Ji, Sai ^{[1
]}

Li, Jun ^{[2
]}

Wu, Zijun ^{[3
]}

Xu, Yicheng ^{[4
,5
]}

机构：

[1] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China

[2] Beijing Univ Technol, Coll Stat & Data Sci, Beijing 100124, Peoples R China

[3] Hefei Univ, Sch Artificial Intelligence & Big Data, Inst Appl Optimizat, Hefei 230000, Peoples R China

[4] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China

[5] Guangxi Key Lab Cryptog & Informat Secur, Guilin 541004, Peoples R China

来源：

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 2023年 / 40卷 / 01期

基金：

中国博士后科学基金; 北京市自然科学基金; 中国国家自然科学基金;

关键词：

Capacitated clustering; min-max correlation clustering; integrality gap; approximation algorithm;

D O I：

10.1142/S0217595922400085

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we propose a so-called capacitated min-max correlation clustering model, a natural variant of the min-max correlation clustering problem. As our main contribution, we present an integer programming and its integrality gap analysis for the proposed model. Furthermore, we provide two approximation algorithms for the model, one of which is a bi-criteria approximation algorithm and the other is based on LP-rounding technique.

引用

页数：13

共 50 条

[1] Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers
Ji, Sai
Li, Min
Liang, Mei
Zhang, Zhenning
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 668 - 675
[2] Improved approximation algorithms for the Min-Max Selecting Items problem
Doerr, Benjamin
INFORMATION PROCESSING LETTERS, 2013, 113 (19-21) : 747 - 749
[3] Approximation Algorithms for the Min-Max Cycle Cover Problem With Neighborhoods
Deng, Lijia
Xu, Wenzheng
Liang, Weifa
Peng, Jian
Zhou, Yingjie
Duan, Lei
Das, Sajal K.
IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (04) : 1845 - 1858
[4] Approximation algorithms for the capacitated correlation clustering problem with penalties
Sai Ji
Gaidi Li
Dongmei Zhang
Xianzhao Zhang
Journal of Combinatorial Optimization, 2023, 45
[5] Approximation algorithms for the capacitated correlation clustering problem with penalties
Ji, Sai
Li, Gaidi
Zhang, Dongmei
Zhang, Xianzhao
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
[6] Approximation algorithms for min-max tree partition
GuttmannBeck, N
Hassin, R
JOURNAL OF ALGORITHMS, 1997, 24 (02) : 266 - 286
[7] Approximation Algorithms for Min-Max Generalization Problems
Berman, Piotr
Raskhodnikova, Sofya
APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 53 - 66
[8] Approximation Algorithms for Min-Max Generalization Problems
Berman, Piotr
Raskhodnikova, Sofya
ACM TRANSACTIONS ON ALGORITHMS, 2014, 11 (01)
[9] Min-Max Correlation Clustering via MultiCut
Ahmadi, Saba
Khuller, Samir
Saha, Barna
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2019, 2019, 11480 : 13 - 26
[10] Approximation Algorithms for Min-Max Cycle Cover Problems
Xu, Wenzheng
Liang, Weifa
Lin, Xiaola
IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (03) : 600 - 613

← 1 2 3 4 5 →