This algorithm has provably performance guarantee

Theorem: The approximation algorithm for Euclidean TSP finds a tour of length at most 3/2 optimal.

Proof:

• weight of MST <= weight of optimal tour

• weight of matching <= (weight of optimal tour)/2

• shortcuts don’t cost

Previous slide

Next slide

Back to first slide

View graphic version