Steele, John M2023-05-232023-05-231980-09-012016-06-21https://repository.upenn.edu/handle/20.500.14332/42199A 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.MathematicsShortest Paths Through Pseudo-Random Points in the $d$-CubeArticle