✦ LIBER ✦

Priority functions for the approximation of the metric TSP

✍ Scribed by Bollig, Beate; Capelle, Michael

Book ID: 125428426
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 343 KB
Volume: 113
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.05.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Deterministic -approximation for the met

Deterministic -approximation for the metric maximum TSP

✍ Łukasz Kowalik; Marcin Mucha 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 764 KB

Approximating the Metric TSP in Linear T

Approximating the Metric TSP in Linear Time

✍ Davide Bilò; Luca Forlizzi; Guido Proietti 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 693 KB

An approximation algorithm for the TSP

✍ J.M. Basart; L. Huguet 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 584 KB

Approximation of discontinuous functions

Approximation of discontinuous functions in the Hausdorff metric

✍ A. P. Petukhov 📂 Article 📅 1985 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 509 KB

Degree of approximation of functions in

Degree of approximation of functions in the Hölder metric

✍ R. N. Mohapatra; P. Chandra 📂 Article 📅 1983 🏛 Akadmiai Kiad 🌐 English ⚖ 341 KB

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