容量最小-最大相关聚类问题的逼近算法

IF 1.1 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Asia-Pacific Journal of Operational Research Pub Date : 2022-01-04 DOI:10.1142/s0217595922400085

S. Ji, Jun Li, Zijun Wu, Yicheng Xu

{"title":"容量最小-最大相关聚类问题的逼近算法","authors":"S. Ji, Jun Li, Zijun Wu, Yicheng Xu","doi":"10.1142/s0217595922400085","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":55455,"journal":{"name":"Asia-Pacific Journal of Operational Research","volume":" ","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2022-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem\",\"authors\":\"S. Ji, Jun Li, Zijun Wu, Yicheng Xu\",\"doi\":\"10.1142/s0217595922400085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":55455,\"journal\":{\"name\":\"Asia-Pacific Journal of Operational Research\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2022-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asia-Pacific Journal of Operational Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1142/s0217595922400085\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asia-Pacific Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1142/s0217595922400085","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们提出了一个所谓的有能力的最小-最大相关聚类模型，它是最小-最大相关聚类问题的自然变体。作为我们的主要贡献，我们提出了一个整数规划及其完整性缺口分析所提出的模型。此外，我们提供了两种近似算法，一种是双准则近似算法，另一种是基于lp舍入技术的近似算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Asia-Pacific Journal of Operational Research 管理科学-运筹学与管理科学

CiteScore

2.00

自引率

14.30%

发文量

审稿时长

14.2 months

期刊介绍： The Asia-Pacific Journal of Operational Research (APJOR) provides a forum for practitioners, academics and researchers in Operational Research and related fields, within and beyond the Asia-Pacific region. APJOR will place submissions in one of the following categories: General, Theoretical, OR Practice, Reviewer Survey, OR Education, and Communications (including short articles and letters). Theoretical papers should carry significant methodological developments. Emphasis is on originality, quality and importance, with particular emphasis given to the practical significance of the results. Practical papers, illustrating the application of Operation Research, are of special interest.