Improved Approximations for Cubic and Cubic Bipartite TSP
نویسنده
چکیده
We show improved approximation guarantees for the traveling salesman problem on cubic graphs, and cubic bipartite graphs. For cubic bipartite graphs with n nodes, we improve on recent results of Karp and Ravi (2014) by giving a simple “local improvement” algorithm that finds a tour of length at most 5/4n − 2. For 2-connected cubic graphs, we show that the techniques of Mömke and Svensson (2011) can be combined with the techniques of Correa, Larré and Soto (2012), to obtain a tour of length at most (4/3− 1/8754)n.
منابع مشابه
Improved Approximations for Cubic Bipartite and Cubic TSP
We show improved approximation guarantees for the traveling salesman problem on cubic bipartite graphs and cubic graphs. For cubic bipartite graphs with n nodes, we improve on recent results of Karp and Ravi by giving a “local improvement” algorithm that finds a tour of length at most 5/4n − 2. For 2-connected cubic graphs, we show that the techniques of Mömke and Svensson can be combined with ...
متن کاملA 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs
We prove new results for approximating 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 ...
متن کاملImproved Approximation Algorithms for Graph-TSP in k-Regular Bipartite Graphs
We prove new results for approximating Graph-TSP. Speci cally, 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 nding a cycle cover with relatively few cycles, which we are able t...
متن کاملA -approximation algorithm for Graphic TSP in cubic bipartite graphs
We prove new results for approximating Graphic TSP. Specifically, we provide a polynomialtime 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 a...
متن کاملSimple cubic graphs with no short traveling salesman tour
Let tsp(G) denote the length of a shortest travelling salesman tour in a graph G. We prove that for any ε > 0, there exists a simple 2-connected planar cubic graph G1 such that tsp(G1) ≥ (1.25 − ε) · |V (G1)|, a simple 2-connected bipartite cubic graph G2 such that tsp(G2) ≥ (1.2 − ε) · |V (G2)|, and a simple 3-connected cubic graph G3 such that tsp(G3) ≥ (1.125− ε) · |V (G3)|.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.07121 شماره
صفحات -
تاریخ انتشار 2015