On the Shortest Path Through a Number of Points
From MaRDI portal
Cited in
(16)- 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
- Minimum rectilinear Steiner tree of n points in the unit square
- The minimal spanning tree and the upper box dimension
- On Steiner's network problem
- On the stretch factor of polygonal chains
- On the stretch factor of polygonal chains
- New Bounds for the Traveling Salesman Constant
- scientific article; zbMATH DE number 7706672 (Why is no real title available?)
- Entropic repulsion of 3D Ising interfaces conditioned to stay above a floor
- On a traveling salesman problem for points in the unit cube
- Two trees are better than one
- Closed curve covering and multiagent TSP ratios
- On the length of optimal TSP circuits in sets of bounded diameter
- Compatible connectivity augmentation of planar disconnected graphs
This page was built for publication: On the Shortest Path Through a Number of Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5807281)
