Given an edge-weighted (metric/general) complete graph with $n$ vertices, the maximum weight (metric/general) $k$-cycle/path packing problem is to find a set of $\frac{n}{k}$ vertex-disjoint $k$-cycles/paths such that the total weight is maximized. In this paper, we consider approximation algorithms. For metric $k$-cycle packing, we improve the previous approximation ratio from $3/5$ to $7/10$ for $k=5$, and from $7/8\cdot(1-1/k)^2$ for $k>5$ to $(7/8-0.125/k)(1-1/k)$ for constant odd $k>5$ and to $7/8\cdot (1-1/k+\frac{1}{k(k-1)})$ for even $k>5$. For metric $k$-path packing, we improve the approximation ratio from $7/8\cdot (1-1/k)$ to $\frac{27k^2-48k+16}{32k^2-36k-24}$ for even $10\geq k\geq 6$. For the case of $k=4$, we improve the approximation ratio from $3/4$ to $5/6$ for metric 4-cycle packing, from $2/3$ to $3/4$ for general 4-cycle packing, and from $3/4$ to $14/17$ for metric 4-path packing.

翻译：给定一个具有 $n$ 个顶点的边赋权（度量/一般）完全图，最大权（度量/一般）$k$-环/路径打包问题旨在寻找一组 $\frac{n}{k}$ 个顶点不相交的 $k$-环/路径，使得总权值最大化。本文研究其近似算法。对于度量 $k$-环打包，当 $k=5$ 时，我们将近似比从 $3/5$ 改进至 $7/10$；当 $k>5$ 时，对于常数奇数 $k>5$，我们将近似比从 $7/8\cdot(1-1/k)^2$ 改进至 $(7/8-0.125/k)(1-1/k)$，对于偶数 $k>5$，改进至 $7/8\cdot (1-1/k+\frac{1}{k(k-1)})$。对于度量 $k$-路径打包，当偶数 $10\geq k\geq 6$ 时，我们将近似比从 $7/8\cdot (1-1/k)$ 改进至 $\frac{27k^2-48k+16}{32k^2-36k-24}$。对于 $k=4$ 的情况，我们将度量 4-环打包的近似比从 $3/4$ 改进至 $5/6$，将一般 4-环打包的近似比从 $2/3$ 改进至 $3/4$，并将度量 4-路径打包的近似比从 $3/4$ 改进至 $14/17$。