考虑一个混合图上的最小-最大圈覆盖问题。给定一个正整数k和一个混合加权图G=（V，E，A），这里V表示顶点集，E表示边集，A表示弧集。E中的每条边和A中的每条弧关联一个权重。问题的要求是确定k个环游，使得这k个环游能够经过A中的所有弧。目标是极小化最大环游的权重。该问题是运筹学和计算机科学中一个重要的组合优化问题，它和它的变形在诸如快递配送、垃圾收集、积雪清扫等相关行业具有广泛应用。针对该问题，通过结合二分搜索和环游撕裂的技巧，首次给出了一个近似比为37/5的近似算法。

We consider a min-max cycle cover problem, in which we are given a positive integer k and a mixed weighted graph G=(V, E, A) with vertex set V, edge set E and arc set A. Each edge in E and each arc in A is associated a weight, respectively. The problem is to determine k tours such that the k tours pass through all the arcs in A. The objective is to minimize the weight of the maximum weight tour. The problem is an important combinatorial optimization problem in operations research and computer science. This problem and its variants are widely used in related industries such as express delivery, trash collection, snow removal, etc. For the problem, we propose the first constant-factor approximation algorithm with ratio 37/5 by using binary search and tour splitting techniques.