• Publications
  • Influence
Convex hulls of random walks
Features related to the perimeter of the convex hull C n of a random walk in R 2 are studied, with particular attention given to its length L n . Bounds on the variance of L n are obtained to showExpand
On the Exact Location of Steiner Points in General Dimension
  • T. Snyder
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 February 1992
TLDR
The Steiner Problem is to form a minimum-length tree that contains a given set of points, where augmentation of the point set with additional (Steiner) points is permitted. Expand
Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
TLDR
A method is presented for determining the asymptotic worst-case behavior of quantities like the length of the minimal spanning tree or an optimal traveling salesman tour of n points in the unit d-cube. Expand
An empirical test of the validity of student evaluations of teaching made on RateMyProfessors.com
The present article examined the validity of public web‐based teaching evaluations by comparing the ratings on RateMyProfessors.com for 126 professors at Lander University to the institutionallyExpand
On minimal rectilinear Steiner trees in all dimensions
  • T. Snyder
  • Computer Science, Mathematics
  • SCG '90
  • 1 May 1990
It is proved that the length of the longest possible minimum rectilinear Steiner tree of <italic>n</italic> points in the unit <italic>d</italic>-cube is asymptotic toExpand
A Priori Bounds on the Euclidean Traveling Salesman
TLDR
We prove that for any set $S$ of points in the unit square and for any minimum-length tour $T$ of $S$, the sum of squares of the edge lengths of any subset $E$ is bounded by $c_3 |E|^{1/2}. Expand
Equidistribution in All Dimensions of Worst-Case Point Sets for the Traveling Salesman Problem
TLDR
A worst-case point set for the traveling salesman problem in the unit square is a point set $S^{(n)}$ whose optimal traveling salesman tour achieves the maximum possible length among all point sets $S\subset [0,1]^d$. Expand
Are they paying attention? Students’ lack of motivation and attention potentially threaten the utility of course evaluations
Student evaluations are a common source of information used by instructors and administrators, but their utility depends on students’ motivation and attention. This paper presents evidence from twoExpand
Worst-case greedy matchings in the unit d-cube
TLDR
The worst-case behavior of greedy matchings of n points in the unit d-cube, where d ≥ 2, is analyzed. Expand
Lower Bounds for Rectilinear Steiner Trees in Bounded Space
  • T. Snyder
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 31 January 1991
TLDR
We prove that, in all dimensions, the total weight of a worst-case minimal rectilinear Steiner tree in the unit d-cube is at least n(d−1) d . Expand
...
1
2
3
...