Abstract
We present in this paper some of the recent techniques and methods for proving best up to now explicit approximation hardness bounds for metric symmetric and asymmetric Traveling Salesman Problem (TSP) as well as related problems of Shortest Superstring and Maximum Compression. We attempt to shed some light on the underlying paradigms and insights which lead to the recent improvements as well as some inherent obstacles for further progress on those problems.
Cite
CITATION STYLE
Karpinski, M. (2015). Towards better inapproximability bounds for TSP: A challenge of global dependencies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9210, pp. 3–11). Springer Verlag. https://doi.org/10.1007/978-3-319-22177-9_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
