Editing Nearest neighbour algorithm (section)

==References==

* G. Gutin, A. Yeo and A. Zverovitch, Exponential Neighborhoods and Domination Analysis for the TSP, in The Traveling Salesman Problem and Its Variations, G. Gutin and A.P. Punnen (eds.), Kluwer (2002) and Springer (2007).
* G. Gutin, A. Yeo and A. Zverovich, [http://www.sciencedirect.com/science/article/pii/S0166218X01001950 Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP]. Discrete Applied Mathematics 117 (2002), 81–86. 
* J. Bang-Jensen, G. Gutin and A. Yeo, [http://www.sciencedirect.com/science/article/pii/S1572528604000222 When the greedy algorithm fails]. Discrete Optimization 1 (2004), 121–127. 
* G. Bendall and F. Margot, [http://www.sciencedirect.com/science/article/pii/S1572528606000430 Greedy Type Resistance of Combinatorial Problems], Discrete Optimization 3 (2006), 288–298.

{{DEFAULTSORT:Nearest Neighbour Algorithm}}
[[Category:Travelling salesman problem]]
[[Category:Approximation algorithms]]
[[Category:Heuristic algorithms]]
[[Category:Graph algorithms]]