Professional Documents
Culture Documents
Hamilton cycles
Hamilton Cycles
WS 2010/11
C. Schauer
C. Schauer
Hamilton cycles
Hamilton cycles
Euler tours
Denition 112 (Euler tour)
A tour is said to be Eulerian in a graph G (V , E ), if every edge e E is traversed exactly once. An Euler tour can be found in O(|V | + |E |).
C. Schauer
C. Schauer
Hamilton cycles
Hamilton cycles
Hamilton Cycle
Denition 115 (Hamilton cycle)
A Hamilton cycle in a graph G (V , E ) is a cylce that contains each vertex v V exactly once.
Sucient conditions
G (V , E ) is connected (G ) 2 (G ) c, constant c > 2 (G ) n , n 3 2 G is dense G is Eulerian
G is dense
n3
G is Eulerian
Theorem 118
A Hamilton graph G (V , E ) contains at least |V | Hamilton paths.
VU Algorithmen auf Graphen C. Schauer 6
Corollary 119
There is no (direct) relationship between Euler and Hamilton graphs.
VU Algorithmen auf Graphen C. Schauer 7
Hamilton cycles
Hamilton cycles
Practical Applications
Traveling Salesman Problem (TSP) Car Sequencing Problem (CarSP / CSP) Reconstruction of Strip-Shredded Documents Networkdesign in general Drilling of Printed Circuit Boards
x{vi ,vj } = 2
N(vi ) . . . all nodes vj V adjacent to vi E (S) . . . edges {vi , vj } incident to nodes in S but not to nodes in V \ S
VU Algorithmen auf Graphen C. Schauer 8 VU Algorithmen auf Graphen C. Schauer 9
Hamilton cycles
Hamilton cycles
TSP Versions
Searched
a Hamilton cycle HC with minimal weight
eHC
w (e)
Asymmetric TSP (undirected graph) Symmetric TSP (directed graph) Metric TSP (triangle inequality) Euclidean TSP (metric TSP with Euclidean distances)
complexity
this problem is known to be NP-hard
C. Schauer
10
C. Schauer
11
Hamilton cycles
Hamilton cycles
heuristics
no guarantee about the solution quality
approximation algorithms
general TSP cannot be approximated but the symmetric, metric TSP
C. Schauer
12
C. Schauer
13
Hamilton cycles
Hamilton cycles
Euclidean TSP
Given
an euclidean graph G (V , E ) a weight function w : E R
Searched
a Hamilton cycle HC with minimal weight
eHC
1 2
w (e)
3 4
compute an MST S duplicate all edges of S /* multigraph S D */ D and give this tour an orientation create an Euler tour F on S go along F and add all vertices when rst visited to nal TSP-tour T
Proposition 121
There are approximation algorithms for this variant of TSP.
Remark 122
To simplify matters assume G is complete. (1)
VU Algorithmen auf Graphen C. Schauer 14 VU Algorithmen auf Graphen
(2)
C. Schauer
(4)
15
Hamilton cycles
Hamilton cycles
Quality of MST-heuristic
Theorem 123
The MST-heuristic is a 2-factor approximation algorithm for the euclidean TSP.
3 4
compute a MST S compute a perfect minimum weight matching M of all nodes with odd degree in S /* graph S M */ M and give this tour an orientation create an Euler tour F on S go along F and add all vertices when rst visited to nal TSP-tour T
Proof.
w (MST ) w (OPT ) w (HEU) 2 w (MST )
(1)
VU Algorithmen auf Graphen C. Schauer 16 VU Algorithmen auf Graphen
(2)
C. Schauer
(4)
17
Hamilton cycles
Quality of Christodes-heuristic
Theorem 124
The Christodes-heuristic is a 3 -factor approximation algorithm for the 2 euclidean TSP.
Proof.
w (MST ) w (OPT ) 1 w (M) 2 w (OPT ) w (HEU) = w (MST ) + w (M) 3 w (OPT ) 2