Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem

DOI10.1137/S0895480194278246zbMath0874.68228OpenAlexW2036001116MaRDI QIDQ4337735

Leandros Tassiulas

Publication date: 26 May 1997

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

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

zbMATH Keywords

worst case analysisEuclidean traveling salesman problemnearest neighbor tours

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Related Items (2)

Degree bounded bottleneck spanning trees in three dimensions ⋮ On the probability distribution of the local times of diagonally operator-self-similar Gaussian fields with stationary increments

This page was built for publication: Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem