Minimizers of the Maximum Distance Problem via an Analyst's Traveling Salesperson Algorithm
Abstract
We provide an upper and lower bound for the length of Maximum Distance Problem minimizers in terms of a finite scale geometric square sum.
0
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.