arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.11225cs.DScs.DM
收藏

用阶为5或更长的路径近似覆盖顶点

Approximately covering vertices by order-$5$ or longer paths

Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang

AI总结:

本文针对NP难的$MPC^{5+}_v$问题,提出基于最大匹配、最大路径-环覆盖和递归的新近似算法,比率2.511,时间复杂度$O(|V|^{2.5}|E|^2)$,优于现有算法。

摘要:

本文研究 $MPC^{5+}_v$ 问题,即在给定图 $G=(V,E)$ 中,用顶点不相交的 $5^+$-路径(即每条路径至少包含五个顶点)尽可能多地覆盖顶点。$MPC^{5+}_v$ 是 NP 难的,现有基于局部搜索的近似算法达到 $\frac {19}7\approx 2.714$ 的比率,运行时间为 $O(|V|^6)$。本文提出一种新的近似算法,达到 $2.511$ 的比率,运行时间为 $O(|V|^{2.5} |E|^2)$。与先前算法不同,新算法基于最大匹配、最大路径-环覆盖和递归。

英文摘要:

This paper studies $MPC^{5+}_v$, which is to cover as many vertices as possible in a given graph $G=(V,E)$ by vertex-disjoint $5^+$-paths (i.e., paths each with at least five vertices). $MPC^{5+}_v$ is NP-hard and admits an existing local-search-based approximation algorithm which achieves a ratio of $\frac {19}7\approx 2.714$ and runs in $O(|V|^6)$ time. In this paper, we present a new approximation algorithm for $MPC^{5+}_v$ which achieves a ratio of $2.511$ and runs in $O(|V|^{2.5} |E|^2)$ time. Unlike the previous algorithm, the new algorithm is based on maximum matching, maximum path-cycle cover, and recursion.

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

↑