๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A hybrid algorithm for TSP

โœ Scribed by Huang Zhangcan; Lu Kuang

Book ID
105648353
Publisher
Wuhan University
Year
1996
Tongue
English
Weight
266 KB
Volume
1
Category
Article
ISSN
1007-1202

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.

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