All Questions
2 questions with no upvoted or accepted answers
3
votes
1
answer
460
views
Generating uniquely $k$-optimal point sets
This question is motivated by the observation that finding an optimal tour through a set of points in the Euclidean plane is especially simple, if the points are in convex configuration and, that the ...
- 13.2k
2
votes
0
answers
97
views
Calculating a Combinatorial Generalization of Planar Convex Hulls
In this question I have suggested a generalization of the notion of a set of points in the Euclidean plane being in convex configuration to the set of vertices of symmetric weighted graphs via $k$-...
- 13.2k