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 ...

I was wondering something, let's say in a symmetric distance matrix of a sample of TSP, there was a sure algorithm that could remove between 30% to 80% of the values (distances) that wouldn't ...