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

DOI10.1016/0095-8956(84)90067-4MaRDI QIDQ762465zbMATHOpenAlexFDO

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

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)

Recommendations

• How Long Can a Euclidean Traveling Salesman Tour Be?
• A Priori Bounds on the Euclidean Traveling Salesman
• A travelling salesman problem in the \(k\)-dimensional unit cube
• Quantizers ad the worst case Euclidean traveling salesman problem
• scientific article; zbMATH DE number 437572

Cites work

• scientific article; zbMATH DE number 3160756 (Why is no real title available?)
• scientific article; zbMATH DE number 3217531 (Why is no real title available?)
• scientific article; zbMATH DE number 3289061 (Why is no real title available?)
• An efficient collision-free protocol for prioritized access-control of cable or radio channels
• Geometrical Extrema Suggested by a Lemma of Besicovitch
• On some applications of graph theory. I
• On the Shortest Path Through a Number of Points
• The shortest path and the shortest road through n points

Cited in

(12)

• Intersections with random geometric objects
• The minimal spanning tree and the upper box dimension
• Compatible connectivity augmentation of planar disconnected graphs
• A Priori Bounds on the Euclidean Traveling Salesman
• Worst-case minimum rectilinear Steiner trees in all dimensions
• Sigma-delta quantization errors and the traveling salesman problem
• Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem
• On a traveling salesman problem for points in the unit cube
• TSP with bounded metrics
• Cost of sequential connection for points in space
• Quantizers ad the worst case Euclidean traveling salesman problem
• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits

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)