An Analysis of Several Heuristics for the Traveling Salesman Problem¶
Rosenkrantz, D. J., Stearns, R. E., & Lewis, II, P. M. (1977). An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM Journal on Computing, 6(3), 563-581.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Nearest-Neighbor Route Extension
- … nearest point does not compose into a globally short route — the method bets that it will, and that bet is famously weak: for the traveling-salesman setting the tour it returns can be arbitrarily worse than optimal as instances grow, precisely because early greed leaves stranded points that force long closing legs.
This sourceShows that the nearest-neighbor traveling-salesman heuristic has a worst-case approximation ratio that grows logarithmically with the number of nodes.
- … nearest point does not compose into a globally short route — the method bets that it will, and that bet is famously weak: for the traveling-salesman setting the tour it returns can be arbitrarily worse than optimal as instances grow, precisely because early greed leaves stranded points that force long closing legs.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:d967d62b13ab · see in the full table