Approximation Algorithm For Euclidean TSP
Find a minimum spanning tree of points
Convert to tour by following DFS and including edge in opposite direction when tour backtracks.
Construct shortcuts by taking direct routes instead of backtracking.
Previous slide
Next slide
Back to first slide
View graphic version