The Analyst's Traveling Salesman Problem asks for conditions under which a (finite or infinite) subset of N is contained on a curve of finite length. We show that for finite sets, the algorithm constructed in {Schul-Hilbert,BNV} that solves the Analyst's Traveling Salesman Problem has polynomial time complexity and we determine the sharp exponent.
No takes yet. Share an insight, caveat, or question.
Ramirez et al. (2024) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: