Time complexity of the Analyst's Traveling Salesman algorithm

02/21/2022
by   Anthony Ramirez, et al.
0

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

page 1

page 2

page 3

page 4

research
12/14/2021

A faster algorithm for Cops and Robbers

We present an algorithm of time complexity O(kn^k+2) deciding whether a ...
research
04/09/2021

Ranking Bracelets in Polynomial Time

The main result of the paper is the first polynomial-time algorithm for ...
research
03/02/2020

Hardness of Sparse Sets and Minimal Circuit Size Problem

We develop a polynomial method on finite fields to amplify the hardness ...
research
11/04/2021

An Empirical Comparison of the Quadratic Sieve Factoring Algorithm and the Pollard Rho Factoring Algorithm

One of the most significant challenges on cryptography today is the prob...
research
09/29/2017

Recognizing Matroids

Let E be a finite set and P, S, L three classes of subsets of E, and ...
research
08/04/2016

A Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem

We propose a new polynomial-time deterministic algorithm that produces a...
research
08/14/2023

Extend Wave Function Collapse to Large-Scale Content Generation

Wave Function Collapse (WFC) is a widely used tile-based algorithm in pr...

Please sign up or login with your details

Forgot password? Click here to reset