In this paper, we study the relationship between the Asymmetric Traveling Salesman Problem (ATSP) and the Cycle Cover Problem in terms of the strength of the triangle inequality on the edge costs in the given complete directed graph instance, G = (V, E). The strength of the triangle inequality is captured by parametrizing the triangle inequality as follows. A complete directed graph G = (V, E) with a cost function c : E → R+ is said to satisfy the γ-parametrized triangle inequality if γ (c (u, w) + c (w, v)) ≥ c (u, v) for all distinct u, v, w ∈ V. Then the graph G is called a γ-triangular graph. For any γ-triangular graph G, for γ < 1, we show that frac(ATSP (G), AP (G)) ≤ frac(γ, 1 - γ) + o (1), where ATSP (G) and AP (G) are the costs of an optimum Hamiltonian cycle and an optimum cycle cover respectively. In addition, we observe that there exists an infinite family of γ-triangular graphs for each valid γ < 1 which demonstrates the near-tightness (up to a factor of frac(1, 2 γ) + o (1)) of the above bound. For γ ≥ 1, the ratio frac(ATSP (G), AP (G)) can become unbounded. The upper bound is shown constructively and can also be viewed as an approximation algorithm for ATSP with parametrized triangle inequality. We also consider the following problem: in a γ-triangular graph, does there exist a function f (γ) such that frac(cmax, cmin) is bounded above by f (γ)? (Here cmax and cmin are the costs of the maximum cost and minimum cost edges respectively.) We show that when γ < frac(1, sqrt(3)), frac(cmax, cmin) ≤ frac(2 γ3, 1 - 3 γ2). This upper bound is sharp in the sense that there exist γ-triangular graphs with frac(cmax, cmin) = frac(2 γ3, 1 - 3 γ2). Moreover, for γ ≥ frac(1, sqrt(3)), no such function f (γ) exists. © 2006 Elsevier Ltd. All rights reserved.
Sunil Chandran, L., & Shankar Ram, L. (2007). On the relationship between ATSP and the cycle cover problem. Theoretical Computer Science, 370(1–3), 218–228. https://doi.org/10.1016/j.tcs.2006.10.026