Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Applications in Management

AAIM 2022: Algorithmic Aspects in Information and Management pp 28–32Cite as

Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP

  • Conference paper
  • First Online:

  • 468 Accesses

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

Abstract

We present a \(\frac{4\lceil \log (n)\rceil }{0.698\lceil \log (n)\rceil +1.302}\)–approximation algorithm for the asymmetric prize-collecting traveling salesman problem. This is obtained by combining a randomized variant of a rounding algorithm of N.H. Nguyen and T.T. Nguyen [6] and a primal-dual algorithm of N.H. Nguyen [7].

Supported by the NSF of China (No. 11971146), the NSF of Hebei Province of China (No. A2019205089, No. A2019205092), Overseas Expertise Introduction Program of Hebei Auspices (25305008) and the Graduate Innovation Grant Program of Hebei Normal University (No. CXZZSS2022053).

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 EPUB and 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

References

  1. Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for prize-collecting Steiner tree and TSP. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science (2009)

    Google Scholar 

  2. Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamon, D.P.: A note on the prize collecting traveling salesman problem. Math. Prog. 59, 413–420 (1993)

    Article  MathSciNet  Google Scholar 

  3. Frieze, A.M., Galbiati, G., Maffioli, F.: On the worst case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, 23–39 (1982)

    Article  MathSciNet  Google Scholar 

  4. Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296–317 (1995)

    Article  MathSciNet  Google Scholar 

  5. Goemans, M.X.: Combining approximation algorithms for the prize-collecting TSP. arXiv arXiv: 0910.0553v1 (2009)

  6. Nguyen, V.H., Nguyen, T.T.: Approximating the asymmetric profitable tour. Int. J. Math. Oper. Res. 4(3), 294–301 (2012)

    Article  MathSciNet  Google Scholar 

  7. Nguyen, V.H.: A primal-dual approximation algorithm for the asymmetric prize-collecting TSP. J. Comb. Optim. 25, 265–278 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hebei Key Laboratory of Computational Mathematics and Applications, School of Mathematical Sciences, Hebei Normal University, Shijiazhuang, 050024, People’s Republic of China

    Bo Hou, Zhenzhen Pang, Suogang Gao & Wen Liu

Authors
  1. Bo Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenzhen Pang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Suogang Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bo Hou .

Editor information

Editors and Affiliations

  1. Guangdong University of Technology, Guangzhou, China

    Qiufen Ni

  2. University of Texas at Dallas, Richardson, TX, USA

    Weili Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hou, B., Pang, Z., Gao, S., Liu, W. (2022). Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP. In: Ni, Q., Wu, W. (eds) Algorithmic Aspects in Information and Management. AAIM 2022. Lecture Notes in Computer Science, vol 13513. Springer, Cham. https://doi.org/10.1007/978-3-031-16081-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-16081-3_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-16080-6

  • Online ISBN: 978-3-031-16081-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation