Fixed-Ratio Approximation Algorithm for the Minimum Cost Cover of a Digraph by Bounded Number of Cycles

Abstract

We consider polynomial time approximation for the minimum cost cycle cover problem of an edge-weighted digraph, where feasible covers are restricted to have at most k disjoint cycles. In the literature this problem is referred to as Min-k-SCCP. The problem is closely related to classic Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) and has many important applications in algorithms design and operations research. Unlike its unconstrained variant, the Min-k-SCCP is strongly NP-hard even on undirected graphs and remains intractable in very specific settings. For any metric, the problem can be approximated in polynomial time within ratio 2, while in fixed-dimensional Euclidean spaces it admits Polynomial Time Approximation Schemes (PTAS). In the same time, approximation of the more general asymmetric Min-k-SCCP still remains weakly studied. In this paper, we propose the first fixed-ratio approximation algorithm for this problem, which extends the recent breakthrough Svensson-Tarnawski-Vegh and Traub-Vygen results for the Asymmetric Traveling Salesman Problem.