Shortest Paths Through Pseudo-Random Points in the d-Cube

DOI10.2307/2042159zbMATH Open0465.10044OpenAlexW2768379151MaRDI QIDQ3916656FDOQ3916656

Authors: J. Michael Steele 

Publication date: 1980

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1011&context=oid_papers

zbMATH Keywords

uniform distributiondiscrepancyanalogue for several pseudorandom sequencesindependent uniformly distributed random observationsshortest path through n points

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Geometric probability and stochastic geometry (60D05) Distribution modulo one (11J71) General theory of distribution modulo (1) (11K06)

Cited In (4)

• Bounds for the traveling salesman paths of two-dimensional modular lattices
• Randomized near-neighbor graphs, giant components and applications in data science
• A new lower bound for the geometric traveling salesman problem in terms of discrepancy
• Random restricted matching and lower bounds for combinatorial optimization

This page was built for publication: Shortest Paths Through Pseudo-Random Points in the d-Cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3916656)