The blind passenger and the assignment problem
Combinatorics, Probability and Computing
Computing the variance of tour costs over the solution space of the TSP in polynomial time
Computational Optimization and Applications
| Hi-index | 0.00 |
Let the edges of the complete graphK nbe assigned independent uniform [0, 1] random edge weights. LetZTSP andZ2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor, respectively. We show thatwhp | ZTSP -Z2FAC| =o(1). The proof is obtained by the analysis of a polynomial time algorithm that finds a tour only a little longer thanZ2FAC.