𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation algorithm for the TSP

✍ Scribed by J.M. Basart; L. Huguet

Book ID
113163368
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
584 KB
Volume
31
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation algorithms for the Euclide
Approximation algorithms for the Euclidean bipartite TSP
✍ Andreas Baltz; Anand Srivastav πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 214 KB

We study approximation results for the Euclidean bipartite traveling salesman problem (TSP). We present the first worstcase examples, proving that the approximation guarantees of two known polynomial-time algorithms are tight. Moreover, we propose a new algorithm which displays a superior average ca

A 78-approximation algorithm for metric
A 78-approximation algorithm for metric Max TSP
✍ Refael Hassin; Shlomi Rubinstein πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 66 KB

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