Abstract
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one.
As applications, we get a 5/4-approximation algorithm for the (minimum) asymmetric TSP with weights one and two and a 3/4-approximation algorithm for the Maximum Directed Path Packing Problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Inform. Processing Letters 85, 301–302 (2003)
Bläser, M.: An 8/13-approximation algorithm for the maximum asymmetric TSP. J. Algorithms 50(1), 23–48 (2004)
Bläser, M., Siebert, B.: Computing cycle covers without short cycles. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 369–379. Springer, Heidelberg (2001)
Bläser, M., Manthey, B.: Approximating maximum weight cycle covers in directed graphs with edge weights zero and one. (2003) (manuscript)
Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. In: Proc. 44th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pp. 56–65 (2003)
Kosaraju, S.R., Park, J.K., Stein, C.: Long tours and short superstrings. In: Proc. 35th Ann. IEEE Symp. on Foundations of Comput. Sci. (FOCS), pp. 166–177 (1994)
Lewenstein, M., Sviridenko, M.: A 5/8 approximation algorithm for the maximum asymmetric TSP. SIAM J. Discrete Math. 17, 237–248 (2003)
Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18, 1–11 (1993)
Vishwanathan, S.: An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inform. Proc. Letters 44, 297–302 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bläser, M. (2004). A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2004 2004. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27821-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-27821-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22894-3
Online ISBN: 978-3-540-27821-4
eBook Packages: Springer Book Archive