New inapproximability bounds for TSP

In this paper, we study the approximability of the metric Traveling Salesman Problem (TSP) and prove new explicit inapproximability bounds for that problem. The best up to now known hardness of approximation bounds were 185/184 for the symmetric case (due to Lampis) and 117/116 for the asymmetric ca...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 81; číslo 8; s. 1665 - 1677
Hlavní autori:	Karpinski, Marek, Lampis, Michael, Schmied, Richard
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.12.2015
Predmet:	Hardness of approximation Travelling Salesman Problem Hardness of approximation Travelling Salesman Problem
ISSN:	0022-0000, 1090-2724
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!