0
$\begingroup$

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 words, I am searching for the worst case scenario of the TSP. Is there any known result for this? Thanks!

Improve this question
$\endgroup$

0

Reset to default

You must log in to answer this question.