Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Journal of the ACM

Volumn 52, Issue 4, 2005, Pages 602-626

  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

Approximation algorithms

Indexed keywords

APPROXIMATION ALGORITHMS; HALL'S THEOREM;

APPROXIMATION THEORY; GRAPH THEORY; POLYNOMIALS; THEOREM PROVING;

ALGORITHMS;

EID: 30544433248     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1082036.1082041     Document Type: Article

References (30)

1. ALON, N. 2003. A simple algorithm for edge-coloring bipartite multigraphs. Inf. Proc. Lett. 85, 6, 301-302.
2. ARMEN, C., AND STEIN, C. 1995. Improved length bounds for the shortest superstring problem (extended abstract). In WADS '95: Proceedings of the 4th International Workshop on Algorithms and Data Structures. Springer-Verlag, London, UK, 494-505.
3. ARMEN, C., AND STEIN, C. 1996. A 2-2/3-approximation algorithm for the shortest superstring problem. In CPM'96: Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching. Springer-Verlag, London, UK, 87-101.
4. BARVINOK, A., GIMADI, E. K., AND SERDYUKOV, A. 2002. The maximum Traveling Salesman Problem. In The Traveling Salesman Problem and Its Variations, G. Gutin and A. Punnen, Eds. Kluwer, 585-607.
5. BLÄSER, M. 2003. A new approximation algorithm for the asymmetric TSP with triangle inequality. In SODA '03: Proceedings of the 14th Annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa., 638-645.
6. BLÄSER, M. 2004. A 3/4-approximation algorithm for maximum ATSP with weights zero and one. In APPROX-RANDOM. 61-71.
7. BLÄSER, M., AND MANTHEY, B. 2002. Two approximation algorithms for 3-cycle covers. In APPROX '02: Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization. Springer-Verlag, London, UK, 40-50.
8. BLÄSER, M., AND SIEBERT, B. 2001. Computing cycle covers without short cycles. In ESA '01: Proceedings of the 9th Annual European Symposium on Algorithms. Springer-Verlag, London, UK, 368-379.
9. BLUM, A., JIANG, T., Li, M., TROMP, J., AND YANNAKAKIS, M. 1994. Linear approximation of shortest superstrings. J. ACM 41, 4, 630-647.
10. BRESLAUER, D., JIANG, T., AND JIANG, Z. 1997. Rotations of periodic strings and short superstrings. J. Algorithms 24, 2, 340-353.
11. CHRISTOFIDES, N. 1976. Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. rep. 388. Graduate School of Industrial Administration, Carnegic Mellon University, Pittsburgh, PA.
12. CZUMAJ, A., GASIENTEC, L., PIOTRÓW, M., AND RYTTER, W. 1997. Sequential and parallel approximation of shortest superstrings. J. Algorithms 23, 1, 74-100.
13. ENGEBRETSEN, L. 2003. An explicit lower bound for TSP with distances one and two. Algorithmica 35, 4, 301-318.
14. ENGEBRETSEN, L., AND KARPINSKI, M. 2001. Approximation hardness of TSP with bounded metrics. In ICALP '01: Proceedings of the 28th International Colloquium on Automata, Languages and Programming. Springer-Verlag, London, UK, 201-212.
15. FRIEZE, A., GALBIATI, G., AND MAFFIOLI, F. 1982. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, 23-39.
16. HASSIN, R., AND RUBINSTEIN, S. 2000. Better approximations for max TSP. Inf. Proc. Lett. 75, 4, 181-186.
17. HASSIN, R., AND RUBINSTEIN, S. 2002. A 7/8-approximation algorithm for metric max TSP. Inf. Proc. Lett. 81, 5, 247-251.
18. HELD, M., AND KARP, R. M. 1970. The traveling-salesman problem and minimum spanning trees. Oper. Res. 18, 1138-1162.
19. HELD, M., AND KARP, R. M. 1971. The traveling-salesman problem and minimum spanning trees: Part II. Math. Prog. 1, 6-25.
20. KARLOFF, H. J., AND SHMOYS, D. B. 1987. Efficient parallel algorithms for edge coloring problems. J. Algorithms 8, 1, 39-52.
21. KOSARAJU, S., PARK, J., AND STEIN, C. 1994. Long tours and short superstrings. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, Press, Los Alamitos, Calif., 166-177.
22. KOSTOCHKA, A. V., AND SERDYUKOV, A. I. 1985. Polynomial algorithms with the estimates 3/4 and 5/6 for the traveling salesman problem of the maximum (Russian). Upravlyaemye Sistemy 26, 55-59.
23. LEWENSTEIN, M., AND SVIRIDENKO, M. 2003. Approximating assymetric maximum TSP. SIAM J. Disc. Math. 77, 237-248.
24. PAPADIMTTRIOU, C. H., AND YANNAKAKIS, M. 1993. The traveling salesman problem with distances one and two. Math. Oper. Res. 18, 1, 1-11.
25. SERDYUKOV, A. I. 1984. The traveling salesman problem of the maximum (Russian). Upravlyaemye Sistemy 25, 80-86.
26. 1/2-approximation algorithm for shortest superstring. SIAM J. Comput. 29, 3, 954-986.
27. TARHIO, J., AND UKKONEN, E. 1988. A greedy approximation algorithm for constructing shortest common superstrings. Theoret. Comput. Sci. 57, 1, 131-145.
28. TENG, S., AND YAO, F. 1997. Approximating shortest superstrings. SIAM Journal on Computing 26, 2, 410-417.
29. TURNER, J. S. 1989. Approximation algorithms for the shortest common superstring problem. Inf. Comput. 83, 1, 1-20.
30. VISHWANATHAN, S. 1992. An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inf. Process. Lett. 44, 6, 297-302.