Minimizers of the Maximum Distance Problem via an Analyst's Traveling Salesperson Algorithm
Enrique Alvarado, Silvia Ghinassi, Lisa Naples
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.
