arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2304.12779cs.DS
收藏

一种用 4^+-路径覆盖顶点的近似算法

An Approximation Algorithm for Covering Vertices by 4^+-Paths

Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Zhaohui Zhan

AI总结:

针对至少含四个顶点的顶点不相交路径最大覆盖问题,本文提出基于最大匹配和最大权路径-环覆盖的新近似算法,将近似比由 2 改进至 1.874。

摘要:

本文研究在给定图 G=(V,E) 中寻找一组顶点不相交路径的问题,要求每条路径至少包含四个顶点,并使这些路径覆盖的顶点总数最大化。该问题是 NP-hard 的,并且已有一种近似算法可达到 2 的近似比,运行时间为 O(|V|^8)。已知算法基于耗时的局部搜索,其作者提出疑问:能否通过一种完全不同的方法设计更好的近似算法?本文对这一问题给出肯定回答,提出了一种新的近似算法。我们的算法达到 1.874 的近似比,运行时间为 O(min{|E|^2|V|^2, |V|^5})。不同于此前最优算法,我们的算法从 G 的一个最大匹配 M 出发,随后利用在适当构造的图中的最大权路径-环覆盖,尝试将 M 转化为一个解。

英文摘要:

This paper deals with the problem of finding a collection of vertex-disjoint paths in a given graph G=(V,E) such that each path has at least four vertices and the total number of vertices in these paths is maximized. The problem is NP-hard and admits an approximation algorithm which achieves a ratio of 2 and runs in O(|V|^8) time. The known algorithm is based on time-consuming local search, and its authors ask whether one can design a better approximation algorithm by a completely different approach. In this paper, we answer their question in the affirmative by presenting a new approximation algorithm for the problem. Our algorithm achieves a ratio of 1.874 and runs in O(min{|E|^2|V|^2, |V|^5}) time. Unlike the previously best algorithm, ours starts with a maximum matching M of G and then tries to transform M into a solution by utilizing a maximum-weight path-cycle cover in a suitably constructed graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑