✦ LIBER ✦

Deterministic -approximation for the metric maximum TSP

✍ Scribed by Łukasz Kowalik; Marcin Mucha

Book ID: 108281572
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 764 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.07.051

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Priority functions for the approximation

Priority functions for the approximation of the metric TSP

✍ Bollig, Beate; Capelle, Michael 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 343 KB

New Approximation Results for the Maximu

New Approximation Results for the Maximum Scatter TSP

✍ Yi-Jen Chiang 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 316 KB

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.

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

A 5/8 Approximation Algorithm for the Ma

A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP

✍ Lewenstein, Moshe; Sviridenko, Maxim 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 174 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