Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Randomization and Approximation Techniques in Computer Science

International Workshop on Approximation Algorithms for Combinatorial Optimization

RANDOM 2004, APPROX 2004: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques pp 61–71Cite as

A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3122))

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.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Inform. Processing Letters 85, 301–302 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. Bläser, M., Manthey, B.: Approximating maximum weight cycle covers in directed graphs with edge weights zero and one. (2003) (manuscript)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. 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)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18, 1–11 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik, ETH Zürich, CH-8092, Zürich, Switzerland

    Markus Bläser

Authors
  1. Markus Bläser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  2. Dept. of CIS, Univ. of Pennsylvania, 19104, Philadelphia, PA

    Sanjeev Khanna

  3. Centre Universitaire d’Informatique, Battelle Bâtiment A, Route de Drize 7, 1227, Carouge, Geneva, Switzerland

    José D. P. Rolim

  4. Tel-Aviv University, Ramat Aviv, Israel

    Dana Ron

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation