Bartal, Yair; Gottlieb, Lee-Ad; Krauthgamer, Robert The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. (English) Zbl 1350.68288 SIAM J. Comput. 45, No. 4, 1563-1581 (2016). MSC: 68W25 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Bartal} et al., SIAM J. Comput. 45, No. 4, 1563--1581 (2016; Zbl 1350.68288) Full Text: DOI arXiv Link
Bartal, Yair; Gottlieb, Lee-Ad; Krauthgamer, Robert The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. (English) Zbl 1286.68177 Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 663-672 (2012). MSC: 68Q17 68W20 68W25 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Bartal} et al., in: Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19--22, 2012. New York, NY: Association for Computing Machinery (ACM). 663--672 (2012; Zbl 1286.68177) Full Text: DOI