A geometric problem involving the nearest neighbour algorithm (Q1094335): Difference between revisions

It is shown that for arbitrary large n there exist sets S in the unit square of \({\mathbb{R}}^ 2\) with \(| S| \leq n\), such that starting at any chosen point \(P_ 1\in S\) and touring S according to the Nearest Neighbour Algorithm, the sum of the squares of the distances exceeds \(c\cdot \log_ 2n\), with \(c>0\).