在权值为1和2的图中逼近最大权循环/路径划分

IF 1.1 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Xinmeng Guo, Wei Yu, Zhaohui Liu
{"title":"在权值为1和2的图中逼近最大权循环/路径划分","authors":"Xinmeng Guo, Wei Yu, Zhaohui Liu","doi":"10.1007/s10878-025-01322-2","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we investigate the maximum weight <i>k</i>-cycle (<i>k</i>-path) partition problem (MaxWkCP/MaxWkPP for short). The input consists of an undirected complete graph <span>\\(G=(V,E)\\)</span> with <span>\\(|V|=kn\\)</span>, where <i>k</i>, <i>n</i> are positive integers, and a non-negative weight function on <i>E</i>, the objective is to determine <i>n</i> vertex disjoint <i>k</i>-cycles (<i>k</i>-paths), which are cycles (paths) containing exactly <i>k</i> vertices, covering all the vertices such that the total edge weight of these cycles (paths) is as large as possible. We propose improved approximation algorithms for the MaxWkCP/MaxWkPP in graphs with weights one and two. For the MaxWkCP in graphs with weights one and two, we obtain an approximation algorithm having an approximation ratio of <span>\\(\\frac{37}{48}\\)</span> for <span>\\(k=6\\)</span>, which improves upon the best available <span>\\(\\frac{91}{120}\\)</span>-approximation algorithm by Zhao and Xiao 2024a. When <span>\\(k=4\\)</span>, we show that the same algorithm is a <span>\\(\\frac{7}{8}\\)</span>-approximation algorithm and give a tight example. This ratio ties with the state-of-the-art result, also given by Zhao and Xiao 2024a. However, we demonstrate that our algorithm can be applied to the minimization variant of MaxWkCP in graphs with weights one and two and achieve a tight approximation ratio of <span>\\(\\frac{5}{4}\\)</span>. For the MaxW5PP in graphs with weights one and two, we devise a novel <span>\\(\\frac{19}{24}\\)</span>-approximation algorithm by combining two separate algorithms, each of which handles one of the two complementary scenarios of the optimal solution well. This ratio is better than the previous best ratio of <span>\\(\\frac{3}{4}\\)</span> due to Li and Yu 2023.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"2 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2025-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximating the maximum weight cycle/path partition in graphs with weights one and two\",\"authors\":\"Xinmeng Guo, Wei Yu, Zhaohui Liu\",\"doi\":\"10.1007/s10878-025-01322-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we investigate the maximum weight <i>k</i>-cycle (<i>k</i>-path) partition problem (MaxWkCP/MaxWkPP for short). The input consists of an undirected complete graph <span>\\\\(G=(V,E)\\\\)</span> with <span>\\\\(|V|=kn\\\\)</span>, where <i>k</i>, <i>n</i> are positive integers, and a non-negative weight function on <i>E</i>, the objective is to determine <i>n</i> vertex disjoint <i>k</i>-cycles (<i>k</i>-paths), which are cycles (paths) containing exactly <i>k</i> vertices, covering all the vertices such that the total edge weight of these cycles (paths) is as large as possible. We propose improved approximation algorithms for the MaxWkCP/MaxWkPP in graphs with weights one and two. For the MaxWkCP in graphs with weights one and two, we obtain an approximation algorithm having an approximation ratio of <span>\\\\(\\\\frac{37}{48}\\\\)</span> for <span>\\\\(k=6\\\\)</span>, which improves upon the best available <span>\\\\(\\\\frac{91}{120}\\\\)</span>-approximation algorithm by Zhao and Xiao 2024a. When <span>\\\\(k=4\\\\)</span>, we show that the same algorithm is a <span>\\\\(\\\\frac{7}{8}\\\\)</span>-approximation algorithm and give a tight example. This ratio ties with the state-of-the-art result, also given by Zhao and Xiao 2024a. However, we demonstrate that our algorithm can be applied to the minimization variant of MaxWkCP in graphs with weights one and two and achieve a tight approximation ratio of <span>\\\\(\\\\frac{5}{4}\\\\)</span>. For the MaxW5PP in graphs with weights one and two, we devise a novel <span>\\\\(\\\\frac{19}{24}\\\\)</span>-approximation algorithm by combining two separate algorithms, each of which handles one of the two complementary scenarios of the optimal solution well. This ratio is better than the previous best ratio of <span>\\\\(\\\\frac{3}{4}\\\\)</span> due to Li and Yu 2023.</p>\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":\"2 1\",\"pages\":\"\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2025-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10878-025-01322-2\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-025-01322-2","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了最大权k-环(k-路径)划分问题(MaxWkCP/MaxWkPP)。输入由一个无向完全图\(G=(V,E)\)和\(|V|=kn\)组成,其中k, n是正整数,以及E上的非负权函数,目标是确定n个顶点不相交的k个循环(k-路径),这些循环(路径)恰好包含k个顶点,覆盖所有顶点,使得这些循环(路径)的总边权尽可能大。在权值为1和2的图中,我们提出了改进的MaxWkCP/MaxWkPP近似算法。对于权值为1和2的图中的MaxWkCP,我们获得了对\(k=6\)的近似比为\(\frac{37}{48}\)的近似算法,该算法改进了Zhao和Xiao 2024a的最佳可用\(\frac{91}{120}\) -近似算法。当\(k=4\)时,我们证明了相同的算法是一个\(\frac{7}{8}\) -近似算法,并给出了一个紧密的例子。这一比例与赵和肖2024a给出的最新结果一致。然而,我们证明了我们的算法可以应用于权重为1和2的图中的MaxWkCP的最小化变体,并实现了\(\frac{5}{4}\)的紧密近似比。对于权重为1和2的图中的MaxW5PP,我们设计了一种新的\(\frac{19}{24}\) -近似算法,该算法结合了两种独立的算法,每种算法都能很好地处理最优解的两个互补场景之一。由于Li和Yu 2023的原因,这个比例比之前的最佳比例\(\frac{3}{4}\)要好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Approximating the maximum weight cycle/path partition in graphs with weights one and two

In this paper, we investigate the maximum weight k-cycle (k-path) partition problem (MaxWkCP/MaxWkPP for short). The input consists of an undirected complete graph \(G=(V,E)\) with \(|V|=kn\), where kn are positive integers, and a non-negative weight function on E, the objective is to determine n vertex disjoint k-cycles (k-paths), which are cycles (paths) containing exactly k vertices, covering all the vertices such that the total edge weight of these cycles (paths) is as large as possible. We propose improved approximation algorithms for the MaxWkCP/MaxWkPP in graphs with weights one and two. For the MaxWkCP in graphs with weights one and two, we obtain an approximation algorithm having an approximation ratio of \(\frac{37}{48}\) for \(k=6\), which improves upon the best available \(\frac{91}{120}\)-approximation algorithm by Zhao and Xiao 2024a. When \(k=4\), we show that the same algorithm is a \(\frac{7}{8}\)-approximation algorithm and give a tight example. This ratio ties with the state-of-the-art result, also given by Zhao and Xiao 2024a. However, we demonstrate that our algorithm can be applied to the minimization variant of MaxWkCP in graphs with weights one and two and achieve a tight approximation ratio of \(\frac{5}{4}\). For the MaxW5PP in graphs with weights one and two, we devise a novel \(\frac{19}{24}\)-approximation algorithm by combining two separate algorithms, each of which handles one of the two complementary scenarios of the optimal solution well. This ratio is better than the previous best ratio of \(\frac{3}{4}\) due to Li and Yu 2023.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信