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 show… Expand

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

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

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 institutionally… Expand

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 to… Expand

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

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

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 two… Expand