Karlin, Anna R.; Klein, Nathan; Gharan, Shayan Oveis An improved approximation algorithm for TSP in the half integral case. (English) Zbl 07298228 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 28-39 (2020). Cited in 1 ReviewCited in 15 Documents MSC: 68Qxx Theory of computing Keywords:approximation algorithms; cactus representation; max entropy; randomized rounding; strongly Rayleigh; traveling salesman problem PDFBibTeX XMLCite \textit{A. R. Karlin} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 28--39 (2020; Zbl 07298228) Full Text: DOI arXiv