A 3/4-approximation algorithm for maximum ATSP with weights zero and one

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 61-71

  Bläser, Markus ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

DIRECTED PATHS; POLYNOMIAL-TIME;

ALGORITHMS;

EID: 30544452226     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_6     Document Type: Article

References (9)

1. N. Alon. A simple algorithm for edge-coloring bipartite multigraphs. Inform. Processing Letters 85:301-302, 2003.
2. M. Bläser. An 8/13-approximation algorithm for the maximum asymmetric TSP. J. Algorithms, 50(1): 23-48, 2004.
3. M. Bläser and B. Siebert. Computing cycle covers without short cycles. In Proc. 9th Ann. European Symp. on Algorithms (ESA), Lecture Notes in Comput. Sci. 2161, 369-379, Springer, 2001.
4. M. Bläser and B. Manthey. Approximating maximum weight cycle covers in directed graphs with edge weights zero and one. Manuscript, 2003.
5. H. Kaplan, M. Lewenstein, N. Shafrir, and M. Sviridenko. Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. In Proc. 44th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pages 56-65, 2003.
6. 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), pages 166-177, 1994.
7. M. Lewenstein and M. Sviridenko. A 5/8 approximation algorithm for the maximum asymmetric TSP. SIAM J. Discrete Math., 17:237-248, 2003.
8. C. H. Papadimitriou and M. Yannakakis, The traveling salesman problem with distances one and two. Math. Oper. Res., 18:1-11, 1993.
9. S. Vishwanathan. An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inform. Proc. Letters, 44:297-302, 1992.