Theorem 34.14: TSP
Variant of proof in textbook.
Given a tour, check that each vertex is visited exactly once and the sum of costs
L' = HC
outputs complete graph with vertices
Weights of edges = 1 if
, or (|V| + 1) if
Also outputs the number |V|.
is clearly implementable in polynomial time.
Then there exists a tour in this complete graph of size
iff there exists a Hamiltonian Cycle in original graph.
Click mouse to advance to next frame.