<p>Is it possible to implement the Christofides algorithm for an directed Graph?</p>

<p>Suppose you have an undirected Graph, in which every vertex has an edges in both ways to every other in the graph (not to itself). But the weights of the edges, don't necessarily have do be the same in both ways (unsymmetrical).</p>

<p>For Example you think of a Street Map, in which there are a lot of oneway streets.</p>

<p>We now want to find an approximation for the traveling salesman tour through all the vertices.</p>

<p>First of all the Christoffides algorithm is not defined for such an TSP, because the Minimum Spanning Tree ist not defined for an directed Graph.</p>

<p>But still we start the algorithm by finding the optimum branching with Edmonds algorithm to the start point of the tour as the root.</p>

<p>Then we find a minimal perfect matching for the branching, so that it becomes an Eulerian graph. This will happen with the Hungarian algorithm, wich finds an minimal matching so that every vertex in the branching has afterwords the same amount of edges coming in an out.</p>

<p>In the last step we find the euler tour and optimize the tour by taking shortcuts.</p>

<p>I have to questions:</p>

<p>Is the way I want to implement the algorithm right, or did I made a mistake and it can't work
If it works, is it still bounded bei 1,5 of the optimal solution for the tsp?</p>

CC BY-SA 3.0
2014-06-12T08:02:13.897Z
I absolutely don't know the algorithm, but perhaps you can convert a directed graph to an undirected equivalent replacing every node with 3 adjacent nodes ($u_1\to u_2 \to u_3$) in which $u_1$ "receives" the incoming edges, $u_3$ "send" the outgoing edges.
Marzio De Biasi
CC BY-SA 3.0
2014-06-12T09:32:58.683Z
The best known approximation ratio for asymmetric TSP is $O(\log n/\log \log n)$ http://www.cs.cmu.edu/~odonnell/hits09/asadpour-goemans-madry-oveis-gharan-saberi-ATSP.pdf. In your question, I don't see how you make the branching Eulerian by adding a matching. The discrepancy between in- and outdegree for vertices can be arbitrarily bad in the branching.
Sasho Nikolov
CC BY-SA 3.0
2014-06-19T17:16:27.517Z
As Sasho mentioned best algorithm for a metric atsp is by Asadpoor etal. But in directed case general idea is to use some good spanning tree and in their paper they called it thin tree. To overcome problem of different weights in different direction we should normalize weights to be almost same in both direction. E.g you can set edge weight be the average of two edges. This was just an example but even in real approximations we use similar simple ideas but proof is complicated(consequencely finding good tree to have approximable behavior is complicated).
Saeed
CC BY-SA 3.0
2014-06-19T17:19:07.790Z
By the way if is not in a metric space we cannot expect any apx . and I cannot see any metric restriction in your question.
Saeed
<tsp><matching><minimization>
Christofides algorithm for directed graph
paul
# Christofides algorithm for directed graph

(Asked by: username_0 on 2014-06-12)

Is it possible to implement the Christofides algorithm for an directed Graph?

Suppose you have an undirected Graph, in which every vertex has an edges in both ways to every other in the graph (not to itself). But the weights of the edges, don't necessarily have do be the same in both ways (unsymmetrical).

For Example you think of a Street Map, in which there are a lot of oneway streets.

We now want to find an approximation for the traveling salesman tour through all the vertices.

First of all the Christoffides algorithm is not defined for such an TSP, because the Minimum Spanning Tree ist not defined for an directed Graph.

But still we start the algorithm by finding the optimum branching with Edmonds algorithm to the start point of the tour as the root.

Then we find a minimal perfect matching for the branching, so that it becomes an Eulerian graph. This will happen with the Hungarian algorithm, wich finds an minimal matching so that every vertex in the branching has afterwords the same amount of edges coming in an out.

In the last step we find the euler tour and optimize the tour by taking shortcuts.

I have to questions:

Is the way I want to implement the algorithm right, or did I made a mistake and it can't work
If it works, is it still bounded bei 1,5 of the optimal solution for the tsp?

**Tags:** tsp, matching, minimization

> **Comments:**
> **username_1**: I absolutely don't know the algorithm, but perhaps you can convert a directed graph to an undirected equivalent replacing every node with 3 adjacent nodes ($u_1\to u_2 \to u_3$) in which $u_1$ "receives" the incoming edges, $u_3$ "send" the outgoing edges.  
> **username_2**: The best known approximation ratio for asymmetric TSP is $O(\log n/\log \log n)$ http://www.cs.cmu.edu/~odonnell/hits09/asadpour-goemans-madry-oveis-gharan-saberi-ATSP.pdf. In your question, I don't see how you make the branching Eulerian by adding a matching. The discrepancy between in- and outdegree for vertices can be arbitrarily bad in the branching.  
> **username_3**: As Sasho mentioned best algorithm for a metric atsp is by Asadpoor etal. But in directed case general idea is to use some good spanning tree and in their paper they called it thin tree. To overcome problem of different weights in different direction we should normalize weights to be almost same in both direction. E.g you can set edge weight be the average of two edges. This was just an example but even in real approximations we use similar simple ideas but proof is complicated(consequencely finding good tree to have approximable behavior is complicated).  
> **username_3**: By the way if is not in a metric space we cannot expect any apx . and I cannot see any metric restriction in your question.  

---

## 0 answers

