Time complexity of the Analyst's Traveling Salesman algorithm
Data Structures and Algorithms
2024-04-09 v2 Computational Complexity
Computational Geometry
Metric Geometry
Abstract
The Analyst's Traveling Salesman Problem asks for conditions under which a (finite or infinite) subset of 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.
Cite
@article{arxiv.2202.10314,
title = {Time complexity of the Analyst's Traveling Salesman algorithm},
author = {Anthony Ramirez and Vyron Vellis},
journal= {arXiv preprint arXiv:2202.10314},
year = {2024}
}
Comments
13 pages