On Random Symmetric Travelling Salesman Problems

  • Authors:

  • Alan M. Frieze

  • Affiliations:

  • -

  • Venue:
  • FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let the edges of the complete graph Kn be assigned independent uniform [0; 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor respectively. We show that whp1 | ZTSP - Z2FAC| = 0(1). The proof is via by the analysis of a polynomial time algorithm that finds a tour only a little longer than Z2FAC.