Skip to main content
SpringerLink
Log in

An Improved Randomized Approximation Algorithm for Max TSP

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We present an O(n3)-time randomized approximation algorithm for the maximum traveling salesman problem whose expected approximation ratio is asymptotically \(\frac{251}{331}\), where n is the number of vertices in the input (undirected) graph. This improves the previous best.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • A.I. Barvinok, D.S. Johnson, G.J. Woeginger, and R. Woodroofe, “Finding Maximum Length Tours under Polyhedral Norms,” Proceedings of the Sixth International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, vol. 1412, pp. 195–201, 1998.

    Google Scholar 

  • P. Chalasani and R. Motwani, “Approximating Capacitated Routing and Delivery Problems,” SIAM Journal on Computing, vol. 28, pp. 2133–2149, 1999.

    Article  Google Scholar 

  • R. Hassin and S. Rubinstein, “An Approximation Algorithm for the Maximum Traveling Salesman Problem,” Information Processing Letters, vol. 67, pp. 125–130, 1998.

    Article  Google Scholar 

  • TSP,” Information Processing Letters, vol. 75, pp. 181–186, 2000.

    Google Scholar 

  • TSP,” Information Processing Letters, vol. 81, pp. 247–251, 2002.

    Google Scholar 

  • (in Russian),” Upravlyaemye Sistemy, vol. 26, pp. 55–59, 1985.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan

    Zhi-Zhong Chen

  2. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang

Authors
  1. Zhi-Zhong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lusheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhi-Zhong Chen.

Additional information

Part of work done while visiting City University of Hong Kong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, ZZ., Wang, L. An Improved Randomized Approximation Algorithm for Max TSP. J Comb Optim 9, 401–432 (2005). https://doi.org/10.1007/s10878-005-1779-7

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-005-1779-7

Keywords

Search

Navigation