Topic: The Traveling Salesman Problem

Weighted Hamiltonian Cycles And Tour Costs

The Odd-Vertex Matching Bound In Christofides Algorithm

The Logarithmic Bound For Nearest-Neighbor Tours

Starting-Vertex Choice And Tie-Breaking In Nearest Neighbor

Spanning-Tree Lower Bounds For TSP

Rooted One-Trees As TSP Lower Bounds

Proof Of Christofides’ Three-Halves Guarantee

Nearest-Neighbor Tour Construction

Metric TSP And Triangle-Inequality Shortcutting

Comparing TSP Heuristics And Lower Bounds On Explicit Graphs