A 97-approximation algorithm for Graphic TSP in cubic bipartite graphs

We prove new results for approximating the Graphic TSP. Specifically, we provide a polynomial-time 97-approximation algorithm for cubic bipartite graphs and a (97+121(k−2))-approximation algorithm for kk-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves finding a cycle cover with relatively few cycles, which we are able to do by leveraging the fact that all cycles in bipartite graphs are of even length along with our knowledge of the structure of cubic graphs.