Answers are grounded in this paper and cite their sources.
Let the edges of the complete graph K n be assigned independent uniform [0, 1] random edge weights. Let Z TSP and Z 2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor, respectively. We show that whp |Z TSP − Z 2FAC | = o(1). The proof is obtained by the analysis of a polynomial time algorithm that finds a tour only a little longer than Z 2FAC .
No takes yet. Share an insight, caveat, or question.
Alan Frieze (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: