nearest neighbour algorithm

The nearest neighbour algorithm may not find a feasible tour at all, even when one exists.

The nearest neighbour algorithm was one of the first algorithms used to determine a solution to the travelling salesman problem.

Nearest neighbour algorithms is a the name given to a number of greedy algorithms to solve problems related to graph theory.

The nearest neighbour algorithm (KNN) belongs to the class of pattern recognition statistical methods.

The nearest neighbour algorithm is easy to implement and executes quickly, but it can sometimes miss shorter routes which are easily noticed with human insight, due to its "greedy" nature.

Examples include Dijkstra's algorithm, Kruskal's algorithm, the nearest neighbour algorithm, and Prim's algorithm.

To be precise, for every constant r there is an instance of the traveling salesman problem such that the length of the tour length computed by the nearest neighbour algorithm is greater than r times the length of the optimal tour.