Step 2: Reduce Hamiltonian Circuit to TSP

• Given a graph G = (V, E) we turn it into GTSP by adding a weight of 1 to each edge.

• Run our nondeterministic TSP algorithm seeking a path of cost |V|.

• GTSP has a solution iff G has a Hamiltonian Circuit.

a

b

d

c

a

b

d

c

1

1

1

1

1

1

Previous slide

Next slide

Back to first slide

View graphic version