Operations, Information and Decisions Papers

Document Type

Journal Article

Date of this Version

9-1980

Publication Source

Proceedings of the American Mathematical Society

Volume

80

Issue

1

Start Page

130

Last Page

134

DOI

10.2307/2042159

Abstract

A lower bound for the length of the shortest path through n points in [0, Ild is given in terms of the discrepancy function of the n points. This bound is applied to obtain an analogue for several pseudorandom sequences to the known limit behavior of the length of the shortest path through n independent uniformly distributed random observations from [0, l]d.

Included in

Mathematics Commons

Share

COinS
 

Date Posted: 27 November 2017

This document has been peer reviewed.