2017/05/05 by Sylvia Boyd, Boyd, Sylvia, András Sebö +1 · 1 citation
Computer Science · Engineering · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.1705.02385
openalex publication_date 2017/05/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Finding the exact integrality gap α for the LP relaxation of the metric Travelling Salesman Problem (TSP) has been an open problem for over thirty years, with little progress made. It is known that 4/3 ≤ α≤ 3/2, and a famous conjecture states α= 4/3. For this problem, essentially two "fundamental" classes of instances have been proposed. This fundamental property means that in order to show that the integrality gap is at most ρ for all instances of metric TSP, it is sufficient to show it only for the instances in the fundamental class. However, despite the importance and the simplicity of such classes, no apparent effort has been deployed for improving the integrality gap bounds for them. In this paper we take a natural first step in this endeavour, and consider the 1/2-integer points of one such class. We successfully improve the upper bound for the integrality gap from 3/2 to 10/7 for a superclass of these points, as well as prove a lower bound of 4/3 for the superclass. Our methods involve innovative applications of tools from combinatorial optimization which have the potential to be more broadly applied.