All Questions

I have the unitary disc $D=\{(x,y) \in R^2: x^2 + y^2 \leq 1\} $, and an integer $n \geq 2$. I want to select $n$ points in $D$ to maximise the length shortest path that connects them all. In other ...

Consider a finite set of points $V \subseteq \mathbb{R}^2 $ as a TSP-instance under the standard $\| \cdot \|_2$ norm. (TSP stands for traveling salesman tour.) We know that every optimal TSP tour $T$ ...