A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
From MaRDI portal
Publication:3937162
DOI10.1137/0211003zbMath0479.90079MaRDI QIDQ3937162
Publication date: 1982
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/58242
Related Items
A partitioning algorithm for minimum weighted Euclidean matching, Partitioning heuristics for two geometric maximization problems, A useful transform of standard input data for a classical NP-complete problem, Maximal paths in random dynamic graphs, Quantizers ad the worst case Euclidean traveling salesman problem, An appraisal of computational complexity for operations researchers, A new iterative Monte Carlo approach for inverse matrix problem, On properties of geometric random problems in the plane