scientific article; zbMATH DE number 437572

MaRDI QIDQ3140451zbMATH OpenFDO

Authors Timothy Law Snyder, J. Michael Steele

Publication date 15 December 1993

zbMATH Keywords

equidistributiontraveling salesmanworst-case point set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem
• Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem
• A Priori Bounds on the Euclidean Traveling Salesman
• On the Travelling Salesperson Problem in Many Dimensions
• How Long Can a Euclidean Traveling Salesman Tour Be?

Cited in

(5)

• A geometric problem involving the nearest neighbour algorithm
• The physicist's approach to the travelling salesman problem
• On the length of optimal TSP circuits in sets of bounded diameter
• 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:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140451)