Approximation Results Toward Nearest Neighbor Heuristic

In this paper, we revisit the famous heuristic called nearest neighbor () for the traveling salesman problem under maximization and minimization goal. We deal with variants where the edge costs belong to interval [; ] for > 0 and > 1, which certainly corresponds to practical cases of these problems. We prove that is ( + 1)/2-approximation for [;] and a 2/( + 1)-approximation for [] under the standard performance ratio. Moreover, we show that these ratios are tight for some instances