- freely available
- re-usable

*Algorithms*
**2011**,
*4*(1),
75-86;
doi:10.3390/a4010075

Published: 20 April 2011

## Abstract

**:**Given a directed graph G with non-negative cost on the arcs, a directed tour cover T of G is a cycle (not necessarily simple) in G such that either head or tail (or both of them) of every arc in G is touched by T. The minimum directed tour cover problem (DToCP), which is to find a directed tour cover of minimum cost, is NP-hard. It is thus interesting to design approximation algorithms with performance guarantee to solve this problem. Although its undirected counterpart (ToCP) has been studied in recent years, in our knowledge, the DToCP remains widely open. In this paper, we give a 2 log

_{2}(n)-approximation algorithm for the DToCP.

## 1. Introduction

Let G = (V, A) be a directed graph with a (non-negative) cost function c : A ⇒ ℚ_{+} defined on the arcs. A directed tour cover T is a subgraph T = (U, F) such that

For every e ∈ A, F contains an arc f intersecting e, i.e., f and e have at least one end-node in common.

T is a closed directed walk (or branching in the case of tree cover).

We consider in this paper the minimum directed tour cover (DToCP) problem which is to find a directed tour cover of minimum cost. As in the previous works [1,2] on the undirected tour cover, we allow the directed tour cover to be a closed directed walk, i.e., it may visit a node more than once, to avoid restricting the cost function c to be a metric. However, if the cost function c satisfies the triangle inequality, this directed walk can be short-cut into a simple directed cycle which covers every arc in A without increasing the cost. The undirected version of DToCP is the minimum tour cover (ToCP) problem which has been studied in recent years. The ToCP was introduced in a paper by Arkin et al. [1]. The authors proved that ToCP is NP-hard and gave a purely combinatorial 5.5-approximation algorithm. Later, Konemann et al. [2] proposed an integer formulation for ToCP and used it to improve the approximation ratio to 3. In this paper, the DToCP was listed as an open problem.

We can prove that DToCP is NP-hard by a reduction from the metric Asymmetric Traveling Salesman Problem (ATSP). The proof is very similar to the one for ToCP described in [1]. Given any instance G = (V, A) of ATSP, for every node v ∈ V, we create a new node v′ and an arc (v, v′) of cost +∞ to obtain a new graph G′. Let us consider the DToCP on G′, we can see that any directed tour cover on G′ must cover V. As the costs are metric, given any directed tour cover, we can find a traveling salesman tour on G of no greater cost. Hence, there is an one-to-one correspondence between the optimal solutions of DToCP on G′ and the optimal traveling salesman tours on G. Moreover, this reduction is approximation-preserving, i.e., if we have an α-approximation algorithm for DToCP then we can approximate the metric ATSP with the same ratio α. In our knowledge, the best approximation ratio for ATSP is so far 0.824log_{2}(n) achieved by Kaplan et al. [3]. Therefore, it is rather difficult to design an algorithm of a constant approximation ratio for DToCP. In this paper, we will present a 2log_{2}(n)-approximation algorithm for the DToCP. This ratio is more than 2 times the ratio for ATSP, since our algorithm is inspired from the algorithm given by Konemann et al. [2] for the undirected case which is based on the bound of the Held-Karp relaxation for metric TSP It is proved that the metric TSP costs no more than
$\frac{3}{2}$ the Held-Karp bound for the undirected case and the metric ATSP costs no more than log_{2}(n) the Held-Karp bound for the directed case [4,5]. Hence, our ratio 2 log_{2}(n) for DToCP follows logically the best ratio 3 for ToCP. Our work for DToCP is motivated by the asymmetric versions of the applications enumerated by Arkin et al. for the undirected case, especially a special case of the Symmetric Traveling Purchaser Problem [1]. We give here a concrete example of applications of DToCP, which is the following simplified version of the waste collection problem. A company is in charge of waste collection in an urban area. The area is supposed to be small enough so that one truck is sufficient to collect all of its daily wastes. The gather is done by the truck in early morning of each day. For each street in the area, waste should be regrouped at one of the end-points of the street in the night of the day before. When the truck goes along a street, this induces some cost to the company. Hence, the aim of the company is to find a cheapest tour from its depot for the truck such that the waste collection is accomplished for every street of the area. Note that streets could be one-way or sloping, making the costs asymmetric. This problem suggests that the depot should belong to the tour. We shall see that our algorithm for DToCP will also work for the case when the tour should contain a fixed vertex.

The paper is organized as follows: In Section 2, we present an integer formulation for DToCP. We discuss in Section 3 about the parsimonious property of Eulerian directed graphs, in particular in Section 3.1. We prove the equivalent directed version of Goemans and Bertsimas's theorem on splitting operations. In Section 3.2, we derive an equivalent linear program to the Held-Karp relaxation for metric ATSP. This linear program will be useful in the analysis of our algorithm's performance guarantee in Section 5. Before that, we state our approximation algorithm for DToCP in Section 4.

Let us introduce the notations that will be used in the paper. Let G = (V, A) be a digraph with vertex set V and arc set A. If x ∈ ℚ^{|}^{A}^{|} is a vector indexed by the arc set A and F ⊆ A is a subset of arcs, we use x(F) to denote the sum of values of x on the arcs in F, x(F) = Σ_{e}_{∈}_{F} x_{e}. Similarly, for a vector y ∈ ℚ^{|}^{V}^{|} indexed by the vertices and S ⊆ V is a subset of vertices, y(S) denotes the sum of values of y on the vertices in the set S. For a subset of vertices S ⊆ V, let A(S) denote the set of the arcs having both end-nodes in S. Let δ^{+}(S) and δ^{−}(S) denote the set of the arcs having only the tail and head in S, respectively. Let δ(S) = δ^{+}(S) ∪ δ^{−}(S). We will call δ^{+}(S) the outgoing cut associated to S, δ^{−}(S) the ingoing cut associated to S and δ(S) simply the cut associated to S. For each vertex v ∈ V, let d^{+}(v) be the outgoing degree of v which is equal to the number of arcs in G having v as tail and let d^{−}(v) be the ingoing degree of v which is equal to the number of arcs in G having v as head. For two subset U, W ⊂ V such that U ∩ W = Ø, let (U : W) be the set of the arcs having the tail in U and the head in W. For u ∈ V, we specify v as an outneighbor of u if (u, v) ∈ A and as an inneighbor of u if (v, u) ∈ A. For any u, v ∈ V, let p(u, v) be the number of arc-disjoint paths from u to v. For the sake of simplicity, in clear contexts, the singleton {u} will be denoted simply by u. When we work on more than one graph, we specify the graph in the index of the notation, e.g.,
${\delta}_{G}^{+}(S)$ will denote δ^{+}(S) in the graph G.

## 2. Integer Formulation

Let

Given any tour cover TC of G, by definition, for any S ∈ ℱ we have TC ∩ δ^{+}(S) ≥ 1 and TC ∩ δ^{−}(S) ≥ 1. Note that the condition TC ∩ δ^{−}(S) ≥ 1 is equivalent to TC ∩ δ^{+}(V \ S) ≥ 1, and by definition of ℱ, a vertex subset S belongs to ℱ if and only if V \ S belongs to ℱ. This observation motivates our integer formulation for DToCP. For any e ∈ A, let x_{e} indicate the number of copies of e included in the tour cover. We minimize the total weight of arcs included, under the condition that every outgoing cut associated to some S ∈ ℱ should be crossed at least one. In order to ensure that our solution is a tour we also need to specify that for any node v ∈ V, the number of arcs entering v is equal to the number of arcs leaving v in the tour. This integer formulation can be stated as follows:

If one specific vertex u should belong to the optimal tour, we just need to set $\text{\u2211}_{e\in {\delta}^{+}(u)}{x}_{e}=\text{\u2211}_{e\in {\delta}^{-}(u)}{x}_{e}\ge 1$ in the formulation. Replacing the integrality constraints by

_{e}

_{∈}

_{A}c

_{e}x

_{e}over DToC(G) can be done in polynomial time since the separation problem of the cut constraint can be solved in polynomial time. Indeed, given a candidate solution x and for every e ∈ A, let us consider x

_{e}as the capacity on arc e. For each pair of arcs e

_{1}, e

_{2}∈ E, we compute the minimum capacity cuts δ

^{+}(U) separating them.

## 3. Parsimonious Property for Directed Eulerian Graphs

#### 3.1. Connectivity and the Splitting Operation

Given a positive integer k, suppose that we want to find a minimum cost strongly k-connected Eulerian directed subgraph of G, i.e., there are at least k arcs-disjoint paths between every pair of vertices. Moreover, each vertex in the subgraph should have the outgoing and ingoing degree both equal to k. The metric ATSP is a special case of this problem when k = 1. An integer formulation for the problem can be stated as follows.

subject to | |

x(δ^{+}(u)) = k | for all u ∈ V |

x(δ^{−}(u)) = k | for all u ∈ V |

x(δ^{+}(S)) ≥ k | for all S ⊂ V such that |S| ≥ 2 |

x_{e} ≥ 0 and integer | for all e ∈ A |

Let us consider the linear programming relaxation of (1).

subject to | |

x(δ^{+}(u)) = k | for all u ∈ V |

x(δ^{−}(u)) = k | for all u ∈ V |

x(δ^{+}(S)) ≥ k | for all S ⊂ V such that |S| ≥ 2 |

x_{e} ≥ 0 | for all e ∈ A |

The parsimonious property for Eulerian directed graphs says that if the costs are metric, in (2), we do not need to impose that the degree of each vertex should be exactly k but only at least k. This means that the following linear program

subject to | |

x(δ^{+}(u)) ≥ k | for all u ∈ V |

x(δ^{+}(u)) = x(δ^{−}(u)) | for all u ∈ V |

x(δ^{+}(S)) ≥ k | for all S ⊂ V such that |S| ≥ 2 |

x_{e} ≥ 0 | for all e ∈ A |

is equivalent to (2).

#### Theorem 1

If the costs c satisfy the triangle inequality then the optimum of (3) is equal to the optimum of the linear programming relaxation (2).

The parsimonious property can be also formulated for undirected Eulerian graphs. We simply replace the outgoing and ingoing cuts in (3) and (2) by the corresponding cut to obtain the two linear programs for the undirected case.

The undirected version of Theorem 1 (in a little more general form) has been proved by Goemans and Bertsimas [6]. Their proof consists mainly in showing the following lemma.

#### Lemma 1

[6] Let G = (V, E) be an Eulerian multigraph. Let c_{G}(i, j) (i, j ∈ V) denote the maximum number of edge-disjoint paths between i and j. Let s be any vertex of G and let u be any neighbor of s. Then there exists another neighbor of s, say v, such that, by splitting su and sv, i.e., removing the edges su and sv and adding the edge uv, we obtain a multigraph G′ satisfying the following conditions:

c

_{G′}(i, j) = c_{G}(i, j) for all i, j ∈V \ {s} andc

_{G′}(s, j) = min(c_{G}(s, j), d_{G}(s) − 2) for all j ∈ V \ {s}, where d_{G}(s) represents the degree of the vertex s in G.

Condition 1 of Lemma 1 is a result due to Lovasz [7] on the connectivity properties of Eulerian multigraphs. Condition 2, added by Goemans and Bertsimas, states that splitting operation can be performed while maintaining most connectivity requirements involving vertex s. For the connectivity of Eulerian multi-digraphs, Jackson [8] shows a similar result as Lovasz's one (i.e., Condition 1) for Eulerian multigraphs. This result can be stated in the following lemma.

#### Lemma 2

[8] Given an Eulerian graph G. Let s be any node of G and let u be any outneighbor of s. Then there exists another inneighbor of s, say v, such that, by splitting (s, u) and (v, s), i.e., removing the arcs (s, u) and (v, s) and adding the arc (v, u), we obtain a multigraph G′ satisfying

p

_{G′}(i, j) = p_{G}(i, j) for all i, j ∈ V \ {s}.

Like the work of Goemans and Bertsimas for the undirected case, we will subsequently prove that we can add a similar condition as Condition 2 of Lemma 1 to Lemma 2 which express the connectivities involving s. We obtain the following lemma.

#### Lemma 3

Let s be any node of G and let u be any outneighbor of s. Then there exists another inneighbor of s, say v, such that, by splitting (s, u) and (v, s), i.e., removing the arcs (s, u) and (v, s) and adding the arc (v, u), we obtain a multigraph G′ satisfying the following conditions:

p

_{G′}(i, j) = p_{G}(i, j) for all i, j ∈ V \ {s} and${p}_{G\prime}(s,j)=min({p}_{G}(s,j),{d}_{G}^{+}(s)-1)$.

#### Proof

Our proof for Lemma 3 is very similar to the Goemans and Bertsimas' proof for Lemma 1. This latter is also in major part inspired from the one of Lovasz for Lemma 1 (Condition 1) which proceeds along the following lines.

There exists at most one set S satisfying:

**(a1)**s ∈ S, u ∉ S,**(b1)**|δ_{g}(S)| = c_{G}(i, j) for some i, j ∈ V, i ∈ S, j ∉ S and i ≠ s and**(c1)**S is minimal with respect to the above two conditions.If there is no such S, then any neighbor v of s can be used for the splitting operation.

If such a S exists then there exists at least one neighbor of s in S. Moreover, any neighbor of s in S can be used for the splitting operation.

We will show that this proof procedure can be used for the directed case. Let us remove the orientation on the arcs of G, then G becomes an undirected Eulerian multigraph. The following remark expresses the relation between c_{G}(i, j), which is the number of edge-disjoint paths between i and j in undirected G, and p_{G}(i, j), which is the number of arc-disjoint paths from i to j (or p_{G}(j, i) for the number of arc-disjoint paths from j to i) in the original directed graph G.

#### Remark 1

Let δ_{G}(S) be the cut associated to S in the undirected G. We have

$|{\delta}_{G}(S)|=2|{\delta}_{G}^{+}(S)|=2|{\delta}_{G}^{-}(S)|$ for all S ⊂ V.

c

_{G}(i, j) = 2p_{G}(i, j) = 2p_{G}(j, i).

#### Proof

We have
${\delta}_{G}(S)={\delta}_{G}^{+}(S)\cup {\delta}_{G}^{-}(S)$ and as
${\delta}_{G}^{+}(S)\cap {\delta}_{G}^{-}(S)=\varnothing $,
$|{\delta}_{G}(S)|=|{\delta}_{G}^{+}(S)|+|{\delta}_{G}^{-}(S)|$. Since G is Eulerian, we have
$|{\delta}_{G}^{+}(S)|=|{\delta}_{G}^{-}(S)|$ for all S ⊂ V. Hence,
$|{\delta}_{G}(S)|=2|{\delta}_{G}^{+}(S)|=2|{\delta}_{G}^{-}(S)|$. For all pair i, j in V with i ≠ j, as p_{G}(j, i) = min{|δ^{+}(T)| : i ∈ T and j ∈ V \ T}, p_{G}(j, i) = min{|δ^{−}(T)| : i ∈ T and j ∈ V \ T} and
$|{\delta}_{G}^{+}(S)|=|{\delta}_{G}^{-}(S)|$ for all T ⊂ V, we have p_{G}(i, j) = p_{G}(j, i) and c_{G}(i, j) = 2p_{G}(i, j) = 2p_{G}(j, i).

Hence, given any s ∈ V, applying the Lovasz's procedure for undirected G, we have

either there exists exactly a S satisfying

**(a1), (b1)**and**(c1)**. Reconsider S in the original directed G, we prove that S satisfies**(a2)**s ∈ S, u ∉ S,**(b2)**$|{\delta}_{G}^{+}(S)|={p}_{G}(i,j)$ for some i, j ∈ V, i ∈ S, j ∉ S and i ≠ s and**(c2)**S is minimal with respect to the above two conditions.Indeed, by Remark 1, if

${\delta}_{G}(S)={c}_{G}(i,j)=min\{|\delta (T)|:i\in T\phantom{\rule{0.3em}{0ex}}\text{and}\phantom{\rule{0.3em}{0ex}}j\in V\backslash T\}$then${\delta}_{G}^{+}(S)={p}_{G}(i,j)=min\{|{\delta}^{+}(T)|:i\in T\phantom{\rule{0.3em}{0ex}}\text{and}\phantom{\rule{0.3em}{0ex}}j\in V\backslash T\}.$The conditions

**(a1)**and**(a2)**(or**(c1)**and**(c2)**, respectively) are the same, independent from the fact that G is directed or not.otherwise, i.e., no S satisfying

**(a1), (b1)**and**(c1)**exists. Then for all S ⊂ V such that s ∈ S and u ∉ S, we have |δ_{G}(S)| > c_{G}(i, j) for all i, j ∈ V, i ∈ S, j ∉ S and i ≠ s. By $|{\delta}_{G}(S)|=2|{\delta}_{G}^{+}(S)|+2|{\delta}_{G}^{-}(S)|$, we have also in the original directed graph G, $|{\delta}_{G}^{+}(S)|>{p}_{G}(i,j)$ for all i, j ∈ V, i ∈ S, j ∉ S and i ≠ s. Hence, we can select any inneighbor v of s and split (s, u) and (v, s) without changing the value of p_{G}(i, j) for all i, j ∈ V \ {s}.

Hence we can summarize below the directed version of Lovasz's proof procedure.

There exists at most one set S satisfying

**(a2), (b2)**and**(c2)**.If there is no such S, then any inneighbor v of s can be used for the splitting operation.

If such a S exists, then there exists at least one inneighbor of s in S. Moreover, any inneighbor of s in S can be used for the splitting operation.

To show Lemma 3, we add a new node ŝ to G and ${d}_{G}^{+}(s)-1$ arcs from ŝ to s and ${d}_{G}^{-}(s)-1$ arcs from s to ŝ. Let Ĝ be this new graph. Clearly, Ĝ is Eulerian. Moreover,

Now applying the proof procedure to Ĝ, we can see that there are two possible cases:

There is no S ⊂ V ∪ {ŝ} that satisfies

**(a2), (b2)**and**(c2)**expressed for Ĝ. Then we can select any inneighbor v ≠ ŝ of s and do the splitting operation on the arcs (v, s) and (s, u). Let G′ be the resulted graph after this splitting operation. Since the splitting operation does not affect the connectivity of all the nodes in V ∪ {ŝ} \ {s}, we have p_{G′}(ŝ, j) = p_{Ĝ}(ŝ, j) for all j ∈ V \ {s}. But as ${d}_{G\prime}^{+}(s)={d}_{G}^{+}(s)-1$,$\begin{array}{c}{p}_{\widehat{G}}(\widehat{s},j)=min({p}_{G}(s,j),{d}_{G}^{+}(s)-1)\phantom{\rule{0.5em}{0ex}}\text{for all}\phantom{\rule{0.5em}{0ex}}j\in V\backslash \{s\}\phantom{\rule{0.2em}{0ex}}\text{and}\\ {p}_{G\prime}(\widehat{s},j)=min({p}_{G\prime}(s,j),{d}_{G\prime}^{+}(s))\phantom{\rule{0.5em}{0ex}}\text{for all}\phantom{\rule{0.5em}{0ex}}j\in V\backslash \{s\}.\end{array}$As p

_{Ĝ}(ŝ, j) = p_{G′}(ŝ, j) then p_{G′}(s, j) can not be strictly smaller than $min({p}_{G}(s,j),{d}_{G}^{+}(s)-1)$ and as p_{G′}(s, j) ≤ p_{g}(s, j), by construction, p_{G′}(s, j) can not be strictly greater than $min({p}_{G}(s,j),{d}_{G}^{+}(s)-1)$. Hence ${p}_{G\prime}(s,j)=min({p}_{G}(s,j),{d}_{G}^{+}(s)-1)$.Otherwise, i.e., there exists exactly one set S ⊂ V ∪ {ŝ} satisfying (

**a2**), (**b2**) and (**c2**). Note that the condition (**b2**) expressed for Ĝ is $|{\delta}_{\widehat{G}}^{+}(S)|={p}_{\widehat{G}}(i,j)$ for some i, j ∈ V ∩ {ŝ}, i ∈ S, j ∉ S and i ≠ s.**Proposition 1**If such a S exists then ŝ ∈ S.Proof. Indeed if ŝ ∉ S then $|{\delta}_{\widehat{G}}^{+}(S)|\ge {d}_{G}^{+}(s)$ since both u and ŝ ∉ S and Ĝ is Eulerian. Moreover $|{\delta}_{\widehat{G}}^{+}(S)|$ would be equal to p

_{Ĝ}(i, ŝ) for some i ∈ S \ {s}. This follows by**(b2)**and the fact that $|{\delta}^{+}{(S\cup \{\widehat{s}\})}_{\widehat{G}}|<|{\delta}_{\widehat{G}}^{+}(S)|$ (since s ∈ S) which implies that there is no i and j in V \ {s} with i ∈ S and j ∉ S such that $|{\delta}_{\widehat{G}}^{+}(S)|={p}_{\widehat{G}}(i,j)$. This leads to a contradiction since ${d}_{G}^{+}(s)\le |{\delta}_{\widehat{G}}^{+}(S)|={p}_{\widehat{G}}(i,\widehat{s})\le {d}_{\widehat{G}}^{-}(\widehat{s})<{d}_{G}^{-}(s)={d}_{G}^{+}(s)$.**Proposition 2**If a S satisfying**(a2)-(c2)**exists, there must exist some v ∈ S with v ≠ ŝ such that v is an inneighbor of s.Proof. Indeed, if S does not contain any inneighbor of s other than ŝ, then $|{\delta}_{\widehat{G}}^{-}(S)=\ge {d}_{G}^{-}(s)$. Hence

$|{\delta}_{\widehat{G}}^{+}(S)|=|{\delta}_{\widehat{G}}^{-}(S)|\ge {d}_{G}^{-}(s)>{d}_{G}^{-}(s)-1={d}_{\widehat{G}}^{+}(\widehat{s})\ge {p}_{\widehat{G}}(\widehat{s},j)$Hence, there would exist some i ∈ S, s ≠ i ≠ ŝ and j ∉ S such that ${\delta}_{\widehat{G}}^{+}(S)={p}_{\widehat{G}}(i,j)$. This leads to a contradiction to the fact that S is minimal since S \ {s, ŝ} would separate i from j and as

$|{\delta}^{+}{(S\backslash \{s,\widehat{s}\})}_{\widehat{G}}|=|{\delta}_{\widehat{G}}^{+}(S)|+|{(S:\{s\})}_{\widehat{G}}|-|{(\{s\}:V\backslash S)}_{\widehat{G}}|$and |(S : {s})_{Ĝ}| = 0 as s ∈ S and |({s} : V \ S)_{Ĝ}| > 0, We have$|{\delta}^{+}{(S\backslash \{s,\widehat{s}\})}_{\widehat{G}}|<|{\delta}_{\widehat{G}}^{+}(S)|$Therefore, there exists some v = ŝ such that by splitting (s, u) and (v, s) we obtain a graph Ĝ′ with p

_{Ĝ}(i, j) = p_{Ĝ′}(i, j) for all i, j ∈ V ∪ {ŝ} \ {s}. After removing ŝ, we obtain a graph G′ which can be also obtained from G by splitting off (s, u) and (s, v). G′ satisfies${p}_{{G}^{\prime}}(i,j)={p}_{{\widehat{G}}^{\prime}}(i,j),={p}_{\widehat{G}}(i,j)={p}_{G}(i,j)\phantom{\rule{0.5em}{0ex}}\text{for all}\phantom{\rule{0.5em}{0ex}}i,j\in V\backslash \{s\}$and${p}_{{G}^{\prime}}(s,j)={p}_{{\widehat{G}}^{\prime}}(s,j),\ge {p}_{{\widehat{G}}^{\prime}}(\widehat{s},j)={p}_{\widehat{G}}(\widehat{s},j)=min({p}_{G}(s,j),{d}_{G}^{+}(s)-1)\phantom{\rule{0.5em}{0ex}}\text{for all}\phantom{\rule{0.5em}{0ex}}j\in V\backslash \{s\}.$Moreover, due to splitting operation p

_{G′}(s, j) ≤ p_{G}(s, j) and ${p}_{G\prime}(s,j)\le {d}_{G}^{+}(s)-1$.

We finish here the proof of Lemma 3.

#### Proof of Theorem 1

Let C be the optimal value of (3) and C′ be the optimal value of (2). As (3) is a relaxation of (2), we have C ≤ C′. To show C ≥ C′ let x be an optimal solution of (3), i.e., C = Σ_{e∈A} c_{e}x_{e}. We can assume without loss of generality that x is integer since there exists some integer p such that px is integer and we can replace k by p.k in (3) and (2). Let G = (V, A) be the multigraph which has x_{e} copies of each arc e such that x_{e} > 0. Applying repeatedly the splitting operation described in Lemma 3 with s chosen among the nodes of V such that x(δ^{+}(s)) > k until
${d}_{G\prime}^{+}(i)=k$ for all i ∈ V, we will obtain a multigraph G′ such that

p

_{G′}(i, j) ≥ k for all i, j ∈ V${d}_{G\prime}^{+}(i)=k$ for all i ∈ V.

Let x′ be the point such that for each e ∈ A, ${x}_{e}^{\prime}$ is equal to the number of copies of e in G′. We can see that x′ is a solution of (2). Since the costs satisfy the triangle inequality, each time we perform a splitting operation the cost of the solution does not increase, which implies that $C={\sum}_{e\in A}{c}_{e}{x}_{e}\ge {\sum}_{e\in A}{c}_{e}{x}_{e}^{\prime}\ge C\prime $.

#### 3.2. Held-Karp Relaxation for ATSP and the Parsimonious Property

Let us consider the Asymmetric Traveling Salesman Problem (ATSP) on G. The Held-Karp bound for this problem can be computed by solving the following linear program:

subject to | |

x(δ^{+}(S)) ≥ 1 | for all S ⊂ V such that |S| ≥ 2 |

x(δ^{+}(v)) = 1 | for all v ∈ V |

x(δ^{−}(v)) = 1 | for all v ∈ V |

0 ≤ x_{e} ≤ 1 | for all e ∈ A |

This linear program is called Held-Karp relaxation for ATSP. In fact the upper bound constraint x_{e} ≤ 1 for all e ∈ A is redundant due to the degree constraints x(δ^{+}(v)) = 1 and x(δ^{−}(v)) = 1 for all v ∈ V. Thus, we can rewrite the Held-Karp relaxation as follows:

subject to | |

x(δ^{+}(S)) ≥ 1 | for all S ⊂ V such that |S| ≥ 2 |

x(δ^{+}(v)) = 1 | for all v ∈ V |

x(δ^{−}(v)) = 1 | for all v ∈ V |

x_{e} ≥ 0 | for all e ∈ A |

The following theorem is a direct application of Theorem 1.

#### Theorem 2

If the costs c satisfy the triangle inequality then the optimum of (4) is equal to the optimum of:

subject to | |

x(δ^{+}(S)) ≥ 1 | for all Ø ≠ S ⊂ V (included S singleton) |

x(δ^{+}(v)) = x(δ^{−}(v)) | for all v ∈ V |

x_{e} ≥ 0 | for all e ∈ A |

## 4. Algorithm

We are now ready to state our algorithm for directed tour cover which is heavily inspired from the one for ToCP in [2].

Let x* be the vector minimizing cx over DToC(G);

Let $U\leftarrow \{v\in V\mid {x}^{\ast}({\delta}^{+}(\{v\}))\ge \frac{1}{2}\}$;

Let G

_{U}= (V_{U}, A_{U}) be a graph with vertex set V_{U}= U and the arc set A_{U}is built as follows: for each pair of nodes i, j ∈ U, if there exists a path from i to j in G, create an arc (i, j) in G_{U}with the cost ${c}_{ij}^{U}$ being equal to the cost of the shortest path from i to j in G;Run the Frieze, Galbiati and Maffioli heuristic [4] to find an approximate minimum traveling salesman directed tour on G

_{U}. Note that the linear program in step**(1)**can be solved in polynomial time by using the ellipsoid method with a minimum cut computation as separation oracle. The algorithm outputs a directed tour which spans U. We can see that U is vertex cover of G. Since for any arc e = (u, v) ∈ A, x*(δ^{+}({u, v})) ≥ 1 and ${x}^{\ast}({\delta}^{+}(\{u,v\}))={x}^{\ast}({\delta}^{+}(u))+{x}^{\ast}({\delta}^{+}(v))-2{x}_{e}^{\ast}$, at least x*(δ^{+}(u)) or x*(δ^{+}(v)) is greater or equal to $\frac{1}{2}$, i.e., at least u or v should belong to U. Therefore, the algorithm outputs a directed tour cover of G.

## 5. Performance Guarantee

Let x* be the vector minimizing Σ_{e∈A} c_{e}x_{e} over DToC(G) and
$U=\{v\in V\mid {x}^{\ast}({\delta}^{+}(\{v\}))\ge \frac{1}{2}\}$. Let y* = 2x*, and let k be the minimum integer such that ky* is integer. Let G̃ = (V, Ã) be the multi-graph that has
${\mathit{\text{ky}}}_{e}^{\ast}$ copies of arc e for each e ∈ Ã. Note that G̃ is Eulerian. For any i ≠ j ∈ V, let p_{G̃}(i, j) be number of disjoint paths from i to j in G̃.

#### Remark 2

p_{G̃}(u, j) ≥ k for all u ∈ U and j ∈ V \ {u}.

#### Proof

To prove the remark, we will show that for any S ⊂ V such that u ∈ S and j ∈ V \ S, we have $|{\delta}_{\stackrel{\sim}{G}}^{-}(S)|\ge k$. Indeed, if A(S) ≠ Ø then by construction, ${x}^{\ast}({\delta}_{\stackrel{\sim}{G}}^{+}(S))\ge \frac{1}{2}$ which implies ${y}^{\ast}({\delta}_{G}^{+}(S))\ge 1$ and consequently $|{\delta}_{\stackrel{\sim}{G}}^{+}(S)|\ge k$. Otherwise, if A(S) = Ø then ${x}^{\ast}({\delta}_{G}^{+}(S))\ge {x}^{\ast}({\delta}^{+}(u))\ge \frac{1}{2}$. Equivalently, ${y}^{\ast}({\delta}_{G}^{+}(S))\ge {y}^{\ast}({\delta}^{+}(u))\ge 1$. Hence, we also have $|{\delta}_{\stackrel{\sim}{G}}^{+}(S)|\ge k$.

In G̃, for each i ∈ V \ U, repeat the splitting operation on i until
${d}_{\stackrel{\sim}{G}}^{+}(i)={d}_{\stackrel{\sim}{G}}^{-}(i)=0$. Consequently, after these operations, all the arcs in G̃ having the end-nodes in U. Let G̃_{U} = (U, Ã_{U}) be the subgraph of induced by U of G̃.

#### Remark 3

After these splitting operations, p_{G̃U}(u, v) ≥ k for all u ∈ U and v ∈ U \ {u}.

Consider the graph G_{U} = (U, A_{U}) that is defined in Step **(2)** of the algorithm. Note that all the arcs in Ã_{U} (with eventually multiple copies) are in A_{U} but there may exist arcs in A_{U} that are not in Ã_{U}. Let x^{U} be the vector in ℝ^{|AU|} such that for each e ∈ A_{U},
${\mathit{\text{x}}}_{e}^{U}=\frac{{p}_{e}}{k}$, where p_{e} is the number of copies of e in Ã_{U} (p_{e} = 0 if e ∉ Ã_{U}).

#### Lemma 4

We have 2cx* = cy* ≥ c^{U}x^{U}.

#### Proof

We have seen that kx^{U} is obtained from ky* by repeated splitting operations on the vertices in V \ U. By definition of c^{U} which takes the shortest path cost, we have c^{U}(kx^{U}) ≤ c(ky*) which implies c^{U}x^{U} ≤ cy* = 2cx*.

Let z* be an optimal solution of Held-Karp relaxation over G_{U}.

#### Lemma 5

c^{U}x^{U} ≥ c^{U}z*.

#### Proof

We can see that x^{U} satisfies the following linear inequalities

_{U}. By Theorem 2, z* minimizes the cost function c

^{U}x over (5). Hence we have c

^{U}x

^{U}≥ c

^{U}z*.

We are ready now to state the main theorem

#### Theorem 3

The algorithm outputs a directed tour cover of cost no more than 2 log_{2}(n) times the cost of the minimum directed tour cover.

#### Proof

The algorithm return, as a solution of DToCP, the traveling salesman directed tour output T by Frieze et al.'s heuristic applied on G_{U}. Let x^{T} be its incidence vector. The cost of T is then equal to c^{U}x^{T}. Williamson [5] proved that the cost of T is not more than log_{2}(n) times the cost of the optimal solution of Held-Karp relaxation over G_{U}, i.e., c^{U}x^{T} ≤ log_{2}(n)c^{U}z*. By Lemmas 5 and 4, we have c^{U}x^{T} ≤ 2 log_{2}(n)cx*.

## 6. Conclusions

In a recent paper [9], Asadpour et al. showed that one can find an asymmetric traveling salesman tour of cost at most O(log n/log log n) times the cost of the optimal solution of the Held-Karp. Hence we can use their algorithm in Step 4 of our algorithm in place of the Frieze et al. heuristic to obtain a ratio of O(log n/log log n) for DToCP. In fact, Asadpour et al. gave a (2 + 8 log n/log log n)-approximate solution for ATSP. This ratio is asymptotically better but worse for realistic value of n (n ≤ 10^{20}) than log_{2}(n), which is the ratio achieved by the Frieze et al. heuristic. An obvious extension is to design a combinatorial approximation algorithm for DToCP. In [1], the authors built combinatorially an undirected tour cover by duplicating some trees over a vertex cover. Since duplicating a branching does not give a directed tour, this idea can not be applied for the directed case. Thus a combinatorial approximation algorithm for DToCP remains wide open. Another possible extension is to use the parsimonious property for Eulerian digraphs in Section 3 to design approximation algorithms for other problems which involve a tour in directed graphs. In another paper [10], we have successfully applied this idea to design an approximation algorithm for the prize collecting asymmetric traveling salesman problem.

## References

- Arkin, E.M.; Halldórsson, M.M.; Hassin, R. Approximating the tree and tour covers of a graph. Inf. Pro. Lett.
**1993**, 47, 275–282. - Könemann, J.; Konjevod, G.; Parekh, O.; Sinha, A. Improved Approximations for Tour and Tree Covers. Algorithmica
**2003**, 38, 441–449. - Kaplan, H.; Lewenstein, M.; Shafrir, N.; Sviridenko, M. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM
**2005**, 52, 602–626. - Frieze, A.M.; Galbiati, G.; Maffioli, F. On the worst case performance of some algorithms for the asymmetric traveling salesman problem. Networks
**1982**, 12, 23–39. - Williamson, D.P. Analysis of the Held-Karp heuristic for the traveling salesman problem. M.D. Thesis, Massachusettes Institute of Technology, Cambridge, MA, USA, 1990.
- Goemans, M.X.; Bertsimas, D.J. On the parsimonious property of connectivity problems. Proceeding of the First Annual ACM-SIAM Symposimum on Discrete Algorithm; Society for Industrial and Applied Mathematics: Philadelphia, PA, USA, 1990; pp. 388–396.
- Lovasz, L. On some connectivity properties of Eulerian graphs. Acta Mathematica Hungarica
**1976**, 28, 129–138. - Jackson, B. Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs. J. Graph Theory
**1988**, 12, 429–436. - Asadpour, A.; Goemans, M.X.; Madry, A.; Oveis Gharan, S.; Saberi, A. An O(log n/log log n)–approximation algorithm for the asymmetric traveling salesman problem. Procceding of 21st ACM-SIAM Symposium on Discrete Algorithms; 2010.
- Nguyen, V.H.; Nguyen, T.T.T. Approximating the asymmetric profitable tour. Electron. Notes Discrete Math.
**2010**, 36, 907–914.

© 2011 by the author; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).