Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 56-65

  Kaplan, Haim ^a   Lewenstein, Moshe ^b   Shafrir, Nira ^a   Sviridenko, Maxim ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; MULTIGRAPHS; SHORTEST SUPERSTRING PROBLEM;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HAMILTONIANS; LINEAR PROGRAMMING; POLYNOMIALS; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

ALGORITHMS;

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

References (24)

1. N. Alon. A Simple algorithm for edge-coloring bipartite multigraphs. Information Processing Letters 85 (2003), 301-302.
2. A. Barvinok, E. Kh. Gimadi and A.I. Serdyukov. The maximum Traveling Salesman problem, in: The Traveling Salesman problem and its variations, 585-607, G. Gutin and A. Punnen, eds., Kluwer, 2002.
3. Markus Bläser. An 8/13 Approximation Algorithm for the Asymmetric Max-TSP. Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, 64-73.
4. Markus Bläser. A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality. In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003, 638-645.
5. M. Bläser, B. Manthey. Two approximation algorithms for 3-cycle covers. Proc. of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Lecture Notes in Comput. Sci. 2462, pp. 40-50, 2002.
6. M. Bläser and B. Siebert, Computing Cycle Covers without Short Cycles, In Proceedings of the European Symposium on Algorithms (ESA), LNCS 2161, 368-380, 2001.
7. 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.
8. D. Breslauer, T. Jiang and Z. Jiang, Rotations of periodic strings and short superstrings, Journal of Algorithms 24(2):340-353, 1997.
9. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, CMU, 1976.
10. L. Engebretsen, An explicit lower bound for TSP with distances one and two. Algorithmica 35(4):301-319, 2003.
11. L. Engebretsen and M. Karpinski, Approximation hardness of TSP with bounded metrics, In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 2076, 201-212, 2001.
12. A. Frieze, G. Galbiati, F. Maffioli. On the worst-case performance of some algorithms for the asymmetric travelling salesman problem. Networks 12, 23-39, 1982.
13. R. Hassin, S. Rubinstein. Better approximations for max TSP. Information Processing Letters, 75(4):181-186, 2000.
14. R. Hassin, S. Rubinstein. A 7/8-approximation algorithm for metric Max TSP. Information Processing Letters, 81(5):247-251, 2002.
15. S.R. Kosaraju, J.K. Park and C. Stein. Long Tours and Short Superstrings. Proc. 35th Annual Symposium on Foundations of Computer Science (FOCS), 166-177, 1994.
16. A. V. Kostochka and A. I. Serdyukov, Polynomial algorithms with the estimates 3/4 and 5/6 for the traveling salesman problem of the maximum. (Russian) Upravlyaemye Sistemy 26:55-59, 1985.
17. M. Lewenstein and M. Sviridenko, Approximating Assymetric Maximum TSP. To appear in SIAM Journal of Discrete Mathematics, preliminary version appeared in Proceedings of SODA03, 646-654, 2003.
18. C. H. Papadimitriou and M. Yannakakis, The traveling salesman problem with distances one and two. Math. Oper. Res. 18(1):1-11, 1993.
19. A. I. Serdyukov, An algorithm with an estimate for the travelling salesman problem of the maximum. (Russian) Upravlyaemye Sistemy 25:80-86, 1984.
20. A. Serdyukov, An asymptotically exact algorithm for the traveling salesman problem for a maximum in Euclidean space, (Russian) Upravlyaemye Sistemy No. 27, 79-87, 1987.
21. Z. Sweedyk, 2 1/2-approximation algorithm for shortest superstring, SIAM J. Comput. 29(3):954-986, 2000.
22. J. Tarhio, E. Ukkonen. A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings. Theoretical Computer Science, 57:131-145, 1988.
23. J. S. Turner. Approximation algorithms for the shortest common superstring problem. Information and Computation, 83:1-20, 1989.
24. S. Vishwanathan, An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inform. Process. Lett. 44(6):297-302, 1992.