Time complexity of the Analyst's Traveling Salesman algorithm
share
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 by Schul (2007)and Badger-Naples-Vellis (2019) that solves the Analyst's Traveling Salesman Problem has polynomial time complexity and we determine the sharp exponent.
READ FULL TEXT