A Priori Bounds on the Euclidean Traveling Salesman
From MaRDI portal
Publication:4842128
DOI10.1137/S0097539792226771zbMath0831.68077OpenAlexW2089841750MaRDI QIDQ4842128
J. Michael Steele, Timothy Law Snyder
Publication date: 26 July 1995
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792226771
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)
Related Items
Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points, Sigma-delta quantization errors and the traveling salesman problem