Nearest Neighbor

Idea: Start at a node. Find closest unvisited node. Visit it. Repeat until finished, then return to start.

Runs fast.

Worst-case ratio of about tex2html_wrap_inline220 (not so good).

Not too bad in practice.


next up previous
Next: Greedy Up: HEURISTIC APPROACHES Previous: Motivation