The Maximum Scatter TSP on a Regular Grid
Abstract
In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied to manufacturing processes, particularly laser melting processes. We extend an algorithm by Arkin et al. that yields optimal solutions for nodes on a line to a regular m × n-grid. The new algorithm Weave(m,n) takes linear time to compute an optimal tour in some cases. It is asymptotically optimal and a 105-approximation for the 3× 4-grid, which is the worst case.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.