Journal ArticleDOI
The shortest path through many points
Jillian Beardwood,John H. Halton,J. M. Hammersley +2 more
- Vol. 55, Iss: 4, pp 299-327
Reads0
Chats0
TLDR
In this paper, it was shown that the length of the shortest closed path through n points in a bounded plane region of area v is almost always asymptotically proportional to √(nv) for large n; and this result was extended to bounded Lebesgue sets in k-dimensional Euclidean space.Abstract:
We prove that the length of the shortest closed path through n points in a bounded plane region of area v is ‘almost always’ asymptotically proportional to √(nv) for large n; and we extend this result to bounded Lebesgue sets in k–dimensional Euclidean space. The constants of proportionality depend only upon the dimensionality of the space, and are independent of the shape of the region. We give numerical bounds for these constants for various values of k; and we estimate the constant in the particular case k = 2. The results are relevant to the travelling-salesman problem, Steiner's street network problem, and the Loberman—Weinberger wiring problem. They have possible generalizations in the direction of Plateau's problem and Douglas' problem.read more
Citations
More filters
Proceedings ArticleDOI
Vehicle routing algorithms to intercept escaping targets
TL;DR: This work proposes three policies: Capturable Nearest Neighbor (CNN), Sector Wise (SW) and Stay Near Boundary (SNB) policy, and derives lower bounds on the fraction of targets captured by the CNN, SW and SNB policies.
Journal ArticleDOI
Rates of Convergence of Means for Distance-Minimizing Subadditive Euclidean Functionals
TL;DR: In this paper, it was shown that a uniform i.i.d. sample from [0, 1]d converges to a finite constant for a class of graphs with vertex set equal to, or in some cases containing, minimal spanning trees.
Journal ArticleDOI
A survey on combinatorial optimization in dynamic environments
TL;DR: This survey presents major results and issues related to the study of NPO problems in dynamic environments, that is, in settings where instances are allowed to undergo some modifications over time, on two complementary frameworks.
Journal ArticleDOI
Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems
TL;DR: It is found that if the cost functions have economies of scale, then the cost per item is bounded in 2-D, which explains the prevalence of the "last mile" effect in many logistics applications.
Proceedings ArticleDOI
Direct estimation of information divergence using nearest neighbor ratios
TL;DR: In this article, a graph theoretical interpretation was proposed to estimate Renyi and f-divergence measures based on a new graph theory interpretation and showed that the average powered ratio of the number of X points to the number Y points among all k-NN points is proportional to Renyi divergence of X and Y densities.
References
More filters
Journal ArticleDOI
On the shortest spanning subtree of a graph and the traveling salesman problem
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Book ChapterDOI
Solution of a Large-Scale Traveling-Salesman Problem
TL;DR: The RAND Corporation in the early 1950s contained Arrow, Bellman, Dantzig, Flood, Ford, Fulkerson, Gale, Johnson, Nash, Orchard-Hays, Robinson, Shapley, Simon, Wagner, and other household names as discussed by the authors.
Journal ArticleDOI