All Questions
1
question
2
votes
1
answer
606
views
The travelling salesman problem for a regular n-gon
The TSP asks, given a finite set $V$ of points in $\Bbb R^2$, to find the shortest path that passes through all points and returns to the starting point. Trivially, one reduces to the case of a path ...
- 27.7k