Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem

DOI10.1137/S0895480194262710zbMATH Open0845.68085OpenAlexW2121942827MaRDI QIDQ4863984FDOQ4863984

Timothy Law Snyder, J. Michael Steele

Publication date: 15 September 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480194262710

zbMATH Keywords

Steiner minimum treeoptimal traveling salesman tour

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Eulerian and Hamiltonian graphs (05C45)

Cited In (3)

• Quantizers ad the worst case Euclidean traveling salesman problem
• Worst-case demand distributions in vehicle routing
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the Travelling Salesperson Problem in Many Dimensions 👍 👎
• On the length of optimal TSP circuits in sets of bounded diameter 👍 👎
• A Priori Bounds on the Euclidean Traveling Salesman 👍 👎

This page was built for publication: Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem

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