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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 641-648

  Berman, Piotr ^a   Karpinski, Marek ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

7/6-APPROXIMATION ALGORITHMS; APPROXIMATION FACTORS; MAXIMUM PATH COVER PROBLEMS;

ALGORITHMS; COLOR; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

POLYNOMIAL APPROXIMATION;

EID: 33244495766     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109627     Document Type: Conference Paper

References (13)

1. [A96] S. Arora, Polynomial Time Approximation Schemes for Euclidean TSP and other Geometric Problems, Proc. 37th IEEE FOCS (1996), pp. 2-11.
2. [BHK02] P. Berman, S. Hannenhalli and M. Karpinski, 1.375-Approximation Algorithm for Sorting by Reversals, Proc. 10th ESA (2002), LNCS 2461, Springer, 2002, pp. 200-210.
3. [BR0S] M. Bläser and L. Shankar Ram, An Improved Approximation for TSP with Distances One and Two, Proc. 15th FCT (2005), LNCS 3623, Springer, 2005, pp. 504-515.
4. [BS01] M. Bläser and B. Seifert, Computing Cycle Covers without Short Cycles, Proc. 9th ESA (2001), LNCS 2161, Springer, 2001, pp. 368-379.
5. [C76] N. Christofides, Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem, Technical Report, GSIA, Carnegie-Mellon University, 1976.
6. [EK01] L. Engebretsen and M. Karpinski, Approximation Hardness of TSP with Bounded Metrics, Proc. 28th ICALP (2001), LNCS 2076, Springer, 2001, pp. 201-212;
7. journal version to appear in JCSS.
8. [FK99] W. Fernandez de la Vega and M. Karpinski, On the Approximation Hardness of Dense TSP and other Path Problems, Information Processing Letters 70 (1999), pp. 53-55.
9. [H84] D. B. Hardvigsen, Extensions of Matching Theory, Ph. D. Thesis, Carnegie Mellon University, 1984.
10. [K72] R. M. Karp, Reducibility among Combinatorial Problems, in R. E. Miller and J. W. Thatcher (Eds.), Plenum, New York, 1972.
11. [PY93] C. H. Papadimitriou and M. Yannakakis, The Traveling Salesman Problem With Distances One and Two, Math. Oper. Res. 18 (1993), pp. 1-11.
12. [T97] L. Trevisan, When Hamming Meets Euclid: The Approximability of Geometric TSP and MST, Proc. 29th ACM STOC (1997), pp. 21-29.
13. [V92] S. Vishwanathan, An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two, Information Processing Letters 44 (1992), pp. 297-302.