Greedy

Kind of like MST algorithm, but works with partial tours.

Start with empty partial tour. Add smallest edge that results in a valid partial tour. Repeat until complete tour reached.

Worst-case ratio no worse than tex2html_wrap_inline220 , maybe better.

In practice, better than MST-based approximation scheme.


next up previous
Next: Local Search Up: HEURISTIC APPROACHES Previous: Nearest Neighbor