Example 2: Approximation Algorithm for Euclidean Traveling Salesman Problem
The Problem: Given n points in the plane (corresponding to the locations of n cities) find a shortest traveling salesman tour
Distances in the plane satisfy the triangle inequality:
dist(a,b) <= dist(a,c) + dist(c,b)