The shortest path and the shortest road through n points

DOI10.1112/S0025579300000784zbMath0067.12604OpenAlexW2151977393WikidataQ56067394 ScholiaQ56067394MaRDI QIDQ3228026

L. Few

Publication date: 1955

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s0025579300000784

zbMATH Keywords

elementary geometry

Related Items

The dynamic team forming problem: throughput and delay for unbiased policies, Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars, Quantizers ad the worst case Euclidean traveling salesman problem, Almost subadditive multiparameter ergodic theorems, Cost of sequential connection for points in space, Submodularity and the traveling salesman problem, The minimum backlog problem, Intersections with random geometric objects, The Performance of greedy algorithms for the on-line steiner tree and related problems, Minimum weight Euclidean \((1+\varepsilon)\)-spanners, Continuous approximation models in freight distribution management, Continuous approximation formulas for location problems, Compatible connectivity augmentation of planar disconnected graphs, Household-Level Economies of Scale in Transportation, Minimum weight Euclidean \((1+\varepsilon)\)-spanners, Watchman tours for polygons with holes, Minimum rectilinear Steiner tree of \(n\) points in the unit square, Extremal uniform distribution and random chord lengths, Connect the dots: how many random points can a regular curve pass through?, Some upper bounds for minimal trees, A primer of the Euclidean Steiner problem, Randomized near-neighbor graphs, giant components and applications in data science, On estimating the distribution of optimal traveling salesman tour lengths using heuristics, The rectilinear Steiner arborescence problem, Worst-case minimum rectilinear Steiner trees in all dimensions, A note on lower bounds for rectilinear Steiner trees, Worst-case demand distributions in vehicle routing, Sigma-delta quantization errors and the traveling salesman problem, Stacks, queues, and deques with order-statistic operations, Gossip algorithms for heterogeneous multi-vehicle routing problems, Asymptotic component densities in programmable gate arrays realizing all circuits of a given size, Nonoscillation theorems in convex sets, Unnamed Item, Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems, The minimal spanning tree and the upper box dimension, On the depth of combinatorial optimization problems, On the shortest separating cycle, The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees, On the length of optimal TSP circuits in sets of bounded diameter, The chaotic universe, New Bounds for the Traveling Salesman Constant, On the Stretch Factor of Polygonal Chains