Approximating asymmetric maximum TSP

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 646-654

  Lewenstein, Moshe ^a,b   Sviridenko, Maxim ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; LINEAR PROGRAMMING; MATRIX ALGEBRA; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

ASYMMETRIC MAXIMUM TRAVELING SALESMAN PROBLEM; POLYNOMIAL TIME APPROXIMATION ALGORITHM;

ALGORITHMS;

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

References (20)

1. A. I. Barvinok, E.Kh. Gimadi and A.I. Serdynkov, The Maximum Traveling Salesman Problem, to appear in the book "The Traveling Salesman Problem and Its Applications", edited by G. Gutin and A. Punnan.
2. Markus Bläser. An 8/13 Approximation Algorithm for the Asymmetric Max-TSP. Proc. of Symposium on Discrete Algorithms, 2002, 64-73.
3. Markus Bläser. An 8/13 Approximation Algorithm for the Asymmetric Max-TSP. TR SIIM-TR-A-01-21, Institute fr Informatik und Mathematik, Universtitt Lbeck, Germany, December 2001.
4. M. Bläser and B. Siebert, Computing Cycle Covers without Short Cycles, In Proceedings of ESA2001, LNCS 2161, pp. 368-380.
5. A. Blum, T. Jiang, M. Li, J. Tromp and M. Yannakakis. Linear Approximation of Shortest Superstring. J. of the ACM, 31(4), 1994, 630-647.
6. D. Breslauer, T. Jiang and Z. Jiang, Rotations of periodic strings and short superstrings, Journal of Algorithms 24(2):340-353, 1997.
7. L. Engebretsen, An explicit lower bound for TSP with distances one and two. STACS 99 (Trier), 373-382. Lecture Notes in Comput. Sci., 1563, Springer, Berlin, 1999.
8. L. Engebretsen and M. Karpinski, Approximation hardness of TSP with bounded metrics, In Fernando Orejas, Paul G. Spirakis, and Jan van Leeuwen, editors, Proceedings of 28th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, v. 2076, pp. 201-212. Springer-Verlag, Crete, Greece, 2001.
9. S. Fiorini and R. Wilson, Edge-colourings of graphs. Research Notes in Mathematics, 16. Pitman, London; distributed by Fearon-Pitman Publishers, Inc., Belmont, Calif., 1977.
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. M. X. Goemans, Worst-case comparison of valid inequalities for the TSP, Math. Programming 69(2A) 335-349, 1995.
12. The traveling salesman problem. A guided tour of combinatorial optimization. Edited by E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys. Wiley-Interscience Series in Discrete Mathematics. A Wiley-Interscience Publication. John Wiley & Sons, Ltd., Chichester, 1985.
13. S.R. Kosaraju, J.K. Park and C. Stein. Long Tours and Short Superstrings. Proc. 35th Annual Symposium on Foundations of Computer Science, 166-177, 1994.
14. M. M. Koval'ov and V. M. Kotov, Estimate of the error of series of approximate algorithms. (Russian) Vestnik Beloruss. Gos. Univ. Ser. I Fiz. Mat. Mekh. 1986, no. 3, 44-48.
15. E. L. Lawler, Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York Montreal, Que.-London, 1976, page 189.
16. C. H. Papadimitrion and M. Yannakakis, The traveling salesman problem with distances one and two. Math. Oper. Res. 18(1):1-11, 1993.
17. Z. Sweedyk, 2 1/2-approximation algorithm for shortest superstring, SIAM J. Comput. 29(3):954-986, 2000.
18. J. Tarhio, E. Ukkonen. A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings. Theoretical Computer Science, 57:131-145, 1988.
19. J. S. Turner, Approximation algorithms for the shortest common superstring problem. Information and Computation, 83:1-20, 1989.
20. S. Vishwanathan, An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inform. Process. Lett. 44(6):297-302, 1992.