In this thesis, we discuss recent progress on higher dimensional analogues to the Analyst’s Travelling Salesman Theorem (TST) of Peter Jones. The TST characterizes subsets of rectifiable curves in the plane, via a multiscale sum of β-numbers. These β-numbers measure how far a set E deviates from a straight line at a particular scale and location. This idea was extended by Okikiolu to subsets of Euclidean space and by Schul to subsets of Hilbert space. In 2018, Azzam and Schul introduced a variant of the Jones β-number. With this, they, and separately Villa, proved similar results for higher dimensional subsets of Euclidean space. In particular, Villa characterizes the lower regular subsets of a certain class of d-dimensional surfaces...
Given a metric space $X$, an Analyst's Traveling Salesman Theorem for $X$ gives a quantitative relat...
In the Euclidean traveling salesman and buyers problem (TSBP), we are given a set of convex regions ...
We show that the length of the minimum spanning tree through points drawn uniformly from the d-dimen...
In his 1990 paper, Jones characterized subsets of rectifiable curves in via a multiscale sum of β-n...
AbstractThe Travelling Salesman Problem is shown to be NP-Complete even if its instances are restric...
It is proved that there are constants $c_{1}$, $c_{2}$, and $c_{3}$ such that for any set S of n poi...
It is proved that there are constants cl, c2, and c3 such that for any set S of n points in the unit...
It is proved that there are constants c1, c2, and c3 such that for any set S of n points in the unit...
Answering a question of the second author in Operations Research Letters 6 (1987) 289-291, we show t...
In the Euclidean traveling salesman and buyers problem (TSBP), we are given a set of convex regions...
Let $P$ be a set of points in $Reals^d$, and let $alpha ge 1$ be a real number. We define the dista...
Let P be a set of points in Rd, and let a = 1 be a real number. We define the distance between two p...
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometr...
The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and en...
4 pages. v2: small revisions, improved argument about dimensions d>2. v3: Final version, with a corr...
Given a metric space $X$, an Analyst's Traveling Salesman Theorem for $X$ gives a quantitative relat...
In the Euclidean traveling salesman and buyers problem (TSBP), we are given a set of convex regions ...
We show that the length of the minimum spanning tree through points drawn uniformly from the d-dimen...
In his 1990 paper, Jones characterized subsets of rectifiable curves in via a multiscale sum of β-n...
AbstractThe Travelling Salesman Problem is shown to be NP-Complete even if its instances are restric...
It is proved that there are constants $c_{1}$, $c_{2}$, and $c_{3}$ such that for any set S of n poi...
It is proved that there are constants cl, c2, and c3 such that for any set S of n points in the unit...
It is proved that there are constants c1, c2, and c3 such that for any set S of n points in the unit...
Answering a question of the second author in Operations Research Letters 6 (1987) 289-291, we show t...
In the Euclidean traveling salesman and buyers problem (TSBP), we are given a set of convex regions...
Let $P$ be a set of points in $Reals^d$, and let $alpha ge 1$ be a real number. We define the dista...
Let P be a set of points in Rd, and let a = 1 be a real number. We define the distance between two p...
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometr...
The Traveling Salesman Problem (TSP) aims to find the shortest tour for a salesman who starts and en...
4 pages. v2: small revisions, improved argument about dimensions d>2. v3: Final version, with a corr...
Given a metric space $X$, an Analyst's Traveling Salesman Theorem for $X$ gives a quantitative relat...
In the Euclidean traveling salesman and buyers problem (TSBP), we are given a set of convex regions ...
We show that the length of the minimum spanning tree through points drawn uniformly from the d-dimen...