On the Shortest Path Through a Number of Points
From MaRDI portal
Publication:5807281
DOI10.2307/2031707zbMath0044.15801OpenAlexW4255766578MaRDI QIDQ5807281
Publication date: 1951
Full work available at URL: https://doi.org/10.2307/2031707
Related Items (13)
Quantizers ad the worst case Euclidean traveling salesman problem ⋮ A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs ⋮ Continuous approximation models in freight distribution management ⋮ Compatible connectivity augmentation of planar disconnected graphs ⋮ Entropic repulsion of 3D Ising interfaces conditioned to stay above a floor ⋮ Minimum rectilinear Steiner tree of \(n\) points in the unit square ⋮ Unnamed Item ⋮ On Steiner's network problem ⋮ Unnamed Item ⋮ The minimal spanning tree and the upper box dimension ⋮ On the length of optimal TSP circuits in sets of bounded diameter ⋮ New Bounds for the Traveling Salesman Constant ⋮ On the Stretch Factor of Polygonal Chains
This page was built for publication: On the Shortest Path Through a Number of Points
