A 78-approximation algorithm for metric Max TSP

https://doi.org/10.1016/S0020-0190(01)00234-4Get rights and content

Abstract

We present a randomized approximation algorithm for the metric version of undirected Max TSP. Its expected performance guarantee approaches 8 as n→∞, where n is the number of vertices in the graph.

References (7)

  • R. Hassin et al.

    Better approximations for Max TSP

    Inform. Process. Lett.

    (2000)
  • A. Barvinok et al.

    Finding maximum length tours under polyhedral norms

  • A. Barvinok, E.Kh. Gimadi, A.I. Serdyukov, The maximum traveling salesman problem, in: G. Gutin, A. Punnen (Eds.), The...
There are more references available in the full text version of this article.

Cited by (0)

View full text