Before revision:  For E\subset R^2, we prove that minimizing over minimal spanning trees that connect the centers of balls of radius s, which cover E, solves the maximum distance problem.
After revision:  For E\subset R^2, we prove that minimizing over minimum spanning trees that connect the centers of balls of radius s, which cover E, solves the maximum distance problem.