8/7-Approximation Algorithm for (1,2)-TSP

@inproceedings{Berman200587ApproximationAF,
  title={8/7-Approximation Algorithm for (1,2)-TSP},
  author={Piotr Berman and Marek Karpinski},
  booktitle={Electronic Colloquium on Computational Complexity},
  year={2005}
}
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… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 53 CITATIONS, ESTIMATED 82% COVERAGE

Approximating Asymmetric TSP in exponential Time

  • Int. J. Found. Comput. Sci.
  • 2014
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Improved integrality gap upper bounds for TSP with distances one and two

VIEW 9 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

TSP with bounded metrics

  • J. Comput. Syst. Sci.
  • 2006
VIEW 7 EXCERPTS
CITES BACKGROUND

A note on bounded weighted graphic metric TSP

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Jens Vygen New approximation algorithms for the TSP

VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2006
2019

CITATION STATISTICS

  • 14 Highly Influenced Citations

References

Publications referenced by this paper.

Reducibility Among Combinatorial Problems

  • 50 Years of Integer Programming
  • 1972
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL