An 8/13-approximation algorithm for the asymmetric maximum TSP

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 64-73

  Bläser, Markus ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION;

PERFORMANCE RATIO; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RUNNING TIME; TRAVELING SALESPERSON PROBLEM;

ALGORITHMS;

EID: 84930241796     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer, 1999.
3. A. I. Barvinok, D. S. Johnson, G. J. Woeginger, and R. Woodroofe. Finding maximum length tours under polyhedral norms. In Proc. 6th Int. Integer Programming and Combinatorial Optimization Conf. (IPCO), LNCS 1412. Springer, 1998.
4. M. Blaser and B. Siebert. Computing cycle covers without short cycles. In Proc. 9th Ann. European Symp. on Algorithms (ESA), LNCS 2161, pages 368-379. Springer, 2001.
5. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yan-nakakis. Linear approximation of shortest super-strings. J. ACM, 41(4):630-647, 1994.
6. D. Breslauer, T. Jiang, and Z. Jiang. Rotations of periodic strings and short superstrings. J. Algorithms, 24:340-353, 1997.
7. R. D. Carr and S. Vempala. Towards a 4/3 approximation for the asymmetric traveling salesman problem. In Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 116-125, 2000.
8. N. Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results, page 441. Academic Press, 1976.
9. L. Engebretsen and M. Karpinski. Approximation hardness of TSP with bounded metrics. In Proc. 28th Int. EATCS Coll. on Automata, Languages and Programming (ICALP), LNCS 2076, pages 201-212. Springer, 2001.
10. M. L. Fisher, L. Nemhauser, and L. A. Wolsey. An analysis of approximations for finding a maximum weight Hamiltonian circuit. Networks, 12(1):799-809, 1979.
11. A. M. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks, 12(1):23-39, 1982.
12. R. Hassin and S. Rubinstein. An approximation algorithm for the maximum traveling salesman problem. Inform. Proc. Letters, 67:125-130, 1998.
13. R. Hassin and S. Rubinstein. Better approximations for maxTSP. Inform. Proc. Letters, 75(4):251-258, 2000.
14. R. Hassin and S. Rubinstein. A g-approximation algorithm for metric MaxTSP. In Proc. 7th Int. Workshop on Algorithms and Data Structures (WADS), LNCS 2125, pages 205-209, 2001.
15. S. R. Kosaraju, J. K. Park, and C. Stein. Long tours and short superstrings. In Proc. 35th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), 1994.
16. A. V. Kostochka and A. I. Serdyukov. Polynomial algorithms with the estimates S and | for the traveling salesman problem of the maximum. Upravlyaemye Sistemy, 26:55-59, 1985. (in Russian).
17. E. L. Lawler, J. K. Lenstra, A. H. G. R. Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem. Wiley, 1985.
18. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Math. Operations Research, 18:1-11, 1993.
19. A. I. Serdyukov. An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy, 25:80-86, 1984. (in Russian).
20. Z. Sweedyk. A 2 1/2-approximation algorithm for shortest superstring. Siam J. Comput, 29(3):954-986, 1999.
21. J. Tarhio and E. Ukkonen. A greedy approximation algorithm for constructing shortest common superstrings. Theoret. Comput. Sci, 57(2):131-145, 1988.
22. J. S. Turner. Approximating algorithms for the shortest common superstring problem. Information and Computation, 83(1):1-20, 1989.