Article ID Journal Published Year Pages File Type
418469 Discrete Applied Mathematics 2016 53 Pages PDF
Abstract

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.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,