On the length of optimal TSP circuits in sets of bounded diameter

DOI10.1016/0095-8956(84)90067-4zbMath0557.52008OpenAlexW2059988211MaRDI QIDQ762465

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

zbMATH Keywords

Euclidean traveling salesman problemshortest circuit

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items (8)

DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits ⋮ Quantizers ad the worst case Euclidean traveling salesman problem ⋮ Cost of sequential connection for points in space ⋮ Intersections with random geometric objects ⋮ Compatible connectivity augmentation of planar disconnected graphs ⋮ Worst-case minimum rectilinear Steiner trees in all dimensions ⋮ Sigma-delta quantization errors and the traveling salesman problem ⋮ The minimal spanning tree and the upper box dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some applications of graph theory. I
• The shortest path and the shortest road through n points
• An efficient collision-free protocol for prioritized access-control of cable or radio channels
• Geometrical Extrema Suggested by a Lemma of Besicovitch
• On the Shortest Path Through a Number of Points

This page was built for publication: On the length of optimal TSP circuits in sets of bounded diameter