8/7-approximation algorithm for (1,2)-TSP

  title={8/7-approximation algorithm for (1,2)-TSP},
  author={Piotr Berman and Marek Karpinski},
  journal={Electron. Colloquium Comput. Complex.},
  • P. Berman, M. Karpinski
  • Published 22 January 2006
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
We design a polynomial time 8/7-approximation algorithm for the Traveling Salesman Problem in which all distances are either one or two. This improves over the best known approximation factor for that problem. As a direct application we get a 7/6-approximation algorithm for the Maximum Path Cover Problem, similarly improving upon the best known approximation factor for that problem. The result depends on a new method of consecutive path cover improvements and on a new analysis of certain… 

Figures from this paper

New Approximation Algorithms for (1, 2)-TSP
This work gives faster and simpler approximation algorithms for the (1,2)-TSP problem, a well-studied variant of the traveling salesperson problem where all distances between cities are either 1 or 2, and their analysis is simpler than the previously best 8/7-approximation.
On the Approximation Ratio of the 3-Opt Algorithm for the (1, 2)-TSP
An Approximate Algorithm for Triangle TSP with a Four-Vertex-Three-Line Inequality
  • Yong Wang
  • Computer Science
    Int. J. Appl. Metaheuristic Comput.
  • 2015
This work gives an approximate algorithm with a four-vertex-three-line inequality for the triangle TSP that can find the better approximations than the double-nearest neighbor algorithm for most TSP instances.
An approximation algorithm for the minimum two peripatetic salesmen problem with different weight functions
This result improves the available algorithm for this problem with approximation ratio 11/7 and presents a polynomial algorithm with time complexity O(n5) and approximation ratio 4/3 for the minimum 2-peripatetic salesman problem in a complete n-vertex graph.
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2
The main result of the paper is the presentation of polynomial algorithms with the currently best guaranteed performance factors 26/21 and 6/5, based on finding the partial tours with a large number of edges in the graphs of a special type.
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract)
This paper gives a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights based on a flow decomposition theorem for solutions of the Held-Karp relaxation.
The Traveling Salesman Problem
The TSP is perhaps the best-studied NP-hard combinatorial optimization problem, and there are many techniques which have been applied, and so-called local search algorithms find better solutions for large instances although they do not have a finite performance ratio.
Approximation efficient algorithms with performance guarantees for some hard routing problems
This work makes several observations on efficient approximation algorithms with proven guarantees for some discrete routing problems that are NP-hard in general case, including the Travelling Salesman Problem and MAX SNP-hard.
An Approximation Algorithm for the Minimum Co-Path Set Problem
An approximation algorithm for the problem of finding a minimum set of edges in a given graph G whose removal from G leaves a graph in which each connected component is a path, which achieves a ratio of 10-7 and runs in O(n1.5) time.


The Traveling Salesman Problem with Distances One and Two
We present a polynomial-time approximation algorithm with worst-case ratio 7/6 for the special case of the traveling salesman problem in which all distances are either one or two. We also show that
On the Approximation Hardness of Dense TSP and Other Path Problems
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
  • Sanjeev Arora
  • Computer Science
    Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
A polynomial time approximation scheme for Euclidean TSP in /spl Rfr//sup 2/ that finds a (1+/spl epsiv/)-approximation to the optimum traveling salesman tour in time n/sup 0(1//spl ePSiv/)/.
Approximation Hardness of TSP with Bounded Metrics
This paper studies the asymmetric and symmetric TSP problems with bounded metrics and proves approximation lower bounds of 101/100 and 203/202, respectively, for these problems, which are known to be approximable only to within an O(log n) factor.
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
It is proved that the Traveling Salesperson Problem (MIN TSP) and the Minimum Steiner Tree problem (MIN ST) are Max SNP-hard (and thus NP-hard to approximate within some constant r > 1) even if all cities lie in the geometric space Rn.
Computing Cycle Covers without Short Cycles
The decision problems whether a directed or undirected graph has a k-cycle cover k-DCC and k-UCC are called and it is proved that Min-k- UCC has no PTAS for k ≥ 12, unless P = NP.
1.375-Approximation Algorithm for Sorting by Reversals
By exploiting the polynomial time algorithm for sorting signed permutations and by developing a new approximation algorithm for maximum cycle decomposition of breakpoint graphs, a new 1.375-algorithm for the MIN-SBR problem is designed.
An Improved Approximation for TSP with Distances One and Two
  • Proc. 15th FCT (2005)
  • 2005
The Traveling Salesman Problem With Distances
  • One and Two, Math. Oper. Res
  • 1993