✦ LIBER ✦

New Approximation Results for the Maximum Scatter TSP

✍ Scribed by Yi-Jen Chiang

Publisher: Springer
Year: 2004
Tongue: English
Weight: 316 KB
Volume: 41
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1124-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Results for Kinetic Varian

Approximation Results for Kinetic Variants of TSP

✍ Hammar; Nilsson 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 161 KB

35/44-approximation for Asymmetric Maxim

35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality

✍ Lukasz Kowalik; Marcin Mucha 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 449 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

New results for scattering on the line

✍ D. Bollé; F. Gesztesy; S.F.J. Wilk 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 436 KB

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

New results for best approximation on Ba

New results for best approximation on Banach lattices

✍ S.M.S. Modarres; M. Dehghani 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 366 KB