Enter a brief description of your changes
(Required)
Minor changes are by default collapsed in the page history.
No changes
The page does not exist yet.
Failed to load changes
Version by on
Leave Collaboration
Are you sure you want to leave the realtime collaboration and continue editing alone? The changes you save while editing alone will lead to merge conflicts with the changes auto-saved by the realtime editing session.
The convex-hull-and-line traveling salesman problem: a solvable case
Vladimir G. Deineko, René van Dal, Günter Rote
Information Processing Letters 51(3), pages 141–148
August 1994
We solve the special case of the Euclidean Traveling Salesman Problem where n − m cities lie on the boundary of the convex hull of all n cities, and the other m cities lie on a line segment inside this convex hull by an algorithm which needs O(mn) time and O space.
space.
Information Processing Letters (IPL)
