On the length of optimal TSP circuits in sets of bounded diameter
From MaRDI portal
Publication:762465
DOI10.1016/0095-8956(84)90067-4zbMATH Open0557.52008OpenAlexW2059988211MaRDI QIDQ762465FDOQ762465
Authors: Shlomo Moran 
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(84)90067-4
Recommendations
Extremal problems in graph theory (05C35) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The shortest path and the shortest road through n points
- Geometrical Extrema Suggested by a Lemma of Besicovitch
- On some applications of graph theory. I
- An efficient collision-free protocol for prioritized access-control of cable or radio channels
- On the Shortest Path Through a Number of Points
Cited In (12)
- TSP with bounded metrics
- DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
- Cost of sequential connection for points in space
- Compatible connectivity augmentation of planar disconnected graphs
- Quantizers ad the worst case Euclidean traveling salesman problem
- The minimal spanning tree and the upper box dimension
- On a traveling salesman problem for points in the unit cube
- Sigma-delta quantization errors and the traveling salesman problem
- Worst-case minimum rectilinear Steiner trees in all dimensions
- Intersections with random geometric objects
- A Priori Bounds on the Euclidean Traveling Salesman
- Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem
This page was built for publication: On the length of optimal TSP circuits in sets of bounded diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762465)
