Documente Academic
Documente Profesional
Documente Cultură
Presented By:
Chris Standish
chriss@cs.tamu.edu
23 November 2005
1
Outline
Problem Definition
2
The Asymmetric Minimum TSP
The Asymmetric Minimum Traveling Salesman Problem (ATSP) is:
3
Definitions
Frieze, et. al. [2] developed an algorithm in 1982 that, until now, has had
the best approximation ratio for minimum ATSP.
4
Friezes Algorithm
Freizes generic algorithm [3] to find an approximate minimum-weighted tour
can be described as:
The algorithm has a performance ratio of 1 log n. That is, it always delivers
a solution which is at most 1 log n times the weight of an optimal solution
[2].
The goal of this paper is to show that this threshold is not tight. The paper
gives an algorithm with a 0.999 log n performance ratio.
5
An Example
Figure 1: Constructing a tour. Most edges are not shown for clarity.
6
Bottleneck in the Generic Algorithm
Notice that if we could construct a n2 -cycle cover we can find an optimal
tour directly. So why dont we?
7
Computing Cycle Covers
The problem of computing a minimum weight cycle cover can be solved by
a relaxed linear program (LP).
Let xuv be the variable that represents the edge (u, v).
If xuv = 1 then the edge is included in a cycle,
if xuv = 0 then it is not.
P
Minimize (u,v)E wuv xuv subject to
P
u xuv = 1 for all v V (in-degree constraints)
P
v xuv = 1 for all u V (out-degree constraints)
8
Relaxed LP formulation
In this particular LP formulation we encounter something quite nice.
9
Good Partial Cycle Covers
In this paper, the generic ATSP algorithm has been modified to use the no-
tion of a good partial cycle cover, see Figure 1.
10
The b-Good Partial Cycle Cover Problem
The b-Good Partial Cycle Cover Problem is:
Given: A directed graph G(V, E), and an asymmetric edge weight function w
that satisfies the triangle inequality.
11
Recursive Generic Algorithm
The generic algorithm this paper uses to find an approximate tour can be de-
scribed as:
12
An Example
C T T
Figure 2: Constructing a tour using a partial cycle cover, and a tour. Not all edges
are shown. T is the tour constructed by combining C and T .
13
Running Time
In the worst case, step 2 reduces the size of the graph by one. That is, only
one 2-cycle is found.
If a b-good cycle cover can be computed in polynomial time, then the generic
recursive cycle cover algorithm will run in polynomial time.
The rest of the paper concentrates on showing that a b-GPCC can be found
in polynomial time.
14
Improved Approximation Ratio
This paper improves the approximation ratio of Frieze, i.e., 1 log n,
by solving a relaxed LP with an additional constraint.
15
Decomposing a Fractional Solution
The rest of the paper is devoted to showing how to compute a 0.999-good
partial cycle cover given a fractional solution X .
16
Some Definitions and a Lemma
doubly stochastic - A matrix S is called doubly stochastic if all its entries are
non-negative, and the entries in each row, and in each column, sum to 1.
t
X
X = i Pi
i=1
Pt
where t n2 , the i are non-negative reals such that i=1 i = 1,
(convexity), and the Pi are permutation matrices.
17
A Permutation Matrix
Notice that every permutation matrix induces a cycle cover of G.
1 2
0 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0
3 4
0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0
0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 1
5 6 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 0
7 8
PERMUTATION MATRIX
2CYCLE COVER
Figure 3: A 2-cycle cover and its corresponding permutation matrix.
18
Reducing the Number of Cycle Covers
Choose a constant B, such that B is the smallest integer such that B i is
an integer, for each i. Define i = B i .
Blaser claims that all the i are rational. So we can find such a B which
will be polynomial in the problem input size.
The point is that we can work with a set of t cycle covers Ci instead of
working with all the B cycle covers explicitly.
19
Normalization
So now lets treat each Pi as a Ci . (Note Ci is a set of edges, Pi is a matrix)
Let Ci Cj denote the graph (V, Ei Ej ). This is the graph formed by the
set of the edges in the two cycle covers.
t
For each of the possible cycle cover pairs Ci Cj , we transform
2
some particularly shaped strongly connected components, that are formed
by 2-cycles in Ci Cj , into larger length cycles.
20
Normalization
21
Computing Good Partial Cycle Covers
When we normalize the union of two cycle covers, we are eliminating 2-
cycles in each of Ci and Cj , and replacing them with larger length cycles.
Blaser gives a case based analysis, and in each case he shows that we can
compute a 0.999-good partial cycle cover.
22
Main Results
Presents a recursive generic algorithm which has a 0.999 log n performance
ratio.
Shows that the approximation ratio of 1 log n shown by Frieze, et. al. [2] is
not tight.
This contrasts with the the set cover problem which has a tight threshold of
1 ln n as shown by Feige [5].
The algorithm does not appear to be practical because its running time de-
pends on the value of B.
23
Homework
Do one of the following problems:
1) Write the minimum ATSP problem in the 4-tuple notation < IQ , SQ , fQ , optQ >
24
References
8
[1] M. Blaser. An 13 -Approximation Algorithm for the Asymmetric Maximum
TSP. Journal of Algorithms, 50(1):2348, 2004.
[4] M. Blaser. A New Approximation Algorithm for the Asymmetric TSP With
Triangle Inequality. In Proceedings of the 14th Annual ACM-SIAM Sympo-
sium on Discrete Algorithms, pages 638645, 2003.
25