A 9/7-approximation algorithm for Graphic TSP in cubic bipartite graphs

被引：6
|
作者：
Karp, Jeremy A. [1 ]
Ravi, R. [1 ]
机构：
[1] Carnegie Mellon Univ, Tepper Sch Business, Pittsburgh, PA 15213 USA
来源：
DISCRETE APPLIED MATHEMATICS | 2016年 / 209卷
基金：
美国国家科学基金会;
关键词：
Approximation algorithms; Traveling salesman problem; Barnette's conjecture; Combinatorial optimization;
D O I：
10.1016/j.dam.2015.10.038
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We prove new results for approximating the Graphic TSP. Specifically, we provide a polynomial-time 9/7-approximation algorithm for cubic bipartite graphs and a (9/7 + 1/21(k-2))-approximation algorithm for k-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. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：164 / 216
页数：53
相关论文
共 28 条
123