✦ LIBER ✦

Algorithms for the universal and a priori TSP

✍ Scribed by Frans Schalekamp; David B. Shmoys

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 125 KB
Volume: 36
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2007.04.009

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.

Average-case approximation ratio of the

Average-case approximation ratio of the 2-opt algorithm for the TSP

✍ Christian Engels; Bodo Manthey 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 474 KB

Evaluating gamut mapping algorithms for

Evaluating gamut mapping algorithms for universal applicability

✍ Ján Morovic; M. Ronnier Luo 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

Greedy heuristics with regret, with appl

Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP

✍ Refael Hassin; Ariel Keinan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 185 KB

A statistical approach to the tsp

✍ B. L. Golden 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 824 KB