Skip to main content
SpringerLink
Log in

A 7/8-Approximation Algorithm for Metric Max TSP

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 2001)

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

Included in the following conference series:

Abstract

We present a randomized approximation algorithm for the metric undirected maximum traveling salesman problem. Its expected performance guarantee approaches 7/8 as n → ∞, where n is the number of vertices in the graph.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Hassin and S. Rubinstein, “Better approximations for Max TSP”, Information Processing Letters 75 (2000), 181–186.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. V. Kostochka and A. I. Serdyukov, “Polynomial algorithms with the estimates 3/4 and 5/6 for the traveling salesman problem of the maximum” (in Russian), Upravlyaemye Sistemy 26 (1985) 55–59.

    MathSciNet  Google Scholar 

  3. A. I. Serdyukov, “An algorithm with an estimate for the traveling salesman problem of the maximum” (in Russian), Upravlyaemye Sistemy 25 (1984) 80–86.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics and Operations Research, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv, 69978, Israel

    Refael Hassin & Shlomi Rubinstein

Authors
  1. Refael Hassin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shlomi Rubinstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Candada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. Center for Geometric Computing, Brown University, Providence, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hassin, R., Rubinstein, S. (2001). A 7/8-Approximation Algorithm for Metric Max TSP. In: Dehne, F., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 2001. Lecture Notes in Computer Science, vol 2125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44634-6_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-44634-6_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42423-9

  • Online ISBN: 978-3-540-44634-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation