Skip to main content
SpringerLink
Log in

Maximum ATSP with Weights Zero and One via Half-Edges

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We present a fast combinatorial 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. The approximation factor of this algorithm matches the currently best one given by Bläser in 2004 and based on linear programming. Our algorithm first computes a maximum size matching and a maximum weight cycle cover without certain cycles of length two but possibly with half-edges - a half-edge of a given edge e is informally speaking a half of e that contains one of the endpoints of e. Then from the computed matching and cycle cover it extracts a set of paths, whose weight is large enough to be able to construct a traveling salesman tour with the claimed guarantee.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Bläser, M.: An 8/13-approximation algorithm for the asymmetric maximum TSP. J. Algorithms 50(1), 23–48 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bläser, M.: A 3/4-approximation algorithm for maximum ATSP with weights zero and one. APPROX-RANDOM. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 8th International Workshop on Randomization and Computation, vol. 3122 of Lecture Notes in Computer Science, pp. 61–71. Springer (2004)

  3. Bläser, M., Siebert, B.: Computing cycle covers without short cycles. In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computing Science, vol. 2161, pp 369–379, Springer (2001)

  4. Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric tsp by decomposing directed regular multigraphs. J. ACM 52(4), 602–626 (2005). Preliminary version appeared in FOCS’03

    Article  MathSciNet  MATH  Google Scholar 

  5. Karpinski, M., Schmied, R.: Improved inapproximability results for the shortest superstring and related problems. In: Proceedings of Nineteenth Computing: The Australasian Theory Symposium, CATS 2013, vol. 141 of CRPIT, pp. 27–36. Australian Computer Society (2013)

  6. Kosaraju, S. R., Park, J. K., Stein, C.: Long tours and short superstrings. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp 166–177 (1994)

  7. Lewenstein, M., Sviridenko, M.: A 5/8 approximation algorithm for the maximum asymmetric tsp. SIAM J. Discrete Math. 17(2), 237–248 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Micali, S., Vazirani, V. V.: An \(O(\sqrt {|V|} |E|)\) algorithm for finding maximum matching in general graphs. FOCS. In: Proceedings of the 21st Annual Symposium on Foundations of Computer Science, pp. 17–27. IEEE Computer Society (1980)

  9. Paluch, K. E.: Maximum ATSP with weights zero and one via half-edges. In: Proceedings of the 13th International Workshop on Approximation and Online Algorithms (2015)

  10. Paluch, K. E., Elbassioni, K. M., van Zuylen, A.: Simpler approximation of the maximum asymmetric traveling salesman problem. In: Proceedings of the 29th Symposium on Theoretical Aspects of Computer Science, STACS’2012, Leibniz International Proceedings of Informatics, vol. 14, pp 501–506 (2012)

  11. Paluch, K.: Better approximation algorithms for maximum asymmetric traveling salesman and shortest superstring. arXiv:1401.3670 (2014)

  12. Vishwanathan, S.: An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inform. Proc. Lett. 44, 297–302 (1992)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wroclaw, Joliot-Curie 15, 50-383, Wroclaw, Poland

    Katarzyna Paluch

Authors
  1. Katarzyna Paluch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Katarzyna Paluch.

Additional information

Partly supported by Polish National Science Center grant UMO-2013/11/B/ST6/01748. Preliminary version of this paper appeared in the conference proceeding of WAOA’15 [9].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Paluch, K. Maximum ATSP with Weights Zero and One via Half-Edges. Theory Comput Syst 62, 319–336 (2018). https://doi.org/10.1007/s00224-017-9818-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-017-9818-1

Keywords

Search

Navigation