We define the average k-TSP distance μtsp,k​ of a graph G as the
average length of a shortest walk visiting k vertices, i.e. the expected
length of the solution for a random TSP instance with k uniformly random
chosen vertices. We prove relations with the average k-Steiner distance and
characterize the cases where equality occurs. We also give sharp bounds for
μtsp,k​(G) given the order of the graph.Comment: 9 pages, 3 figure