Approximation Hardness of TSP with Bounded Metrics

Lars Engebretsen, Marek Karpinski. Approximation Hardness of TSP with Bounded Metrics. Electronic Colloquium on Computational Complexity (ECCC), 7(89), 2000. [doi]

Abstract

Abstract is missing.