Work

The Average Solution of a TSP Instance in a Graph

Year: 2025

Type: article

Abstract: ABSTRACT We define the average ‐TSP distance of a graph as the average length of a shortest closed walk visiting vertices, that is, the expected length of the solution for a random TSP instance with uniformly random chosen vertices. We prove relations with the average ‐Steiner distance and characterize the cases where equality occurs. We also give sharp bounds for given the order of the graph.

Source: Journal of Graph Theory

DOI: 10.1002/jgt.23232

Author: Stijn Cambie

Institution: KU Leuven

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, Fonds Wetenschappelijk Onderzoek, Institute for Basic Science

Awards: G2765210714, Building bridges between graph colouring, extremal and structural graph theory, Mathematics Research Communities