Traub, Vera; Vygen, Jens An improved approximation algorithm for the asymmetric traveling salesman problem. (English) Zbl 07488098 SIAM J. Comput. 51, No. 1, 139-173 (2022). MSC: 68W25 05C85 90C27 PDFBibTeX XMLCite \textit{V. Traub} and \textit{J. Vygen}, SIAM J. Comput. 51, No. 1, 139--173 (2022; Zbl 07488098) Full Text: DOI
Traub, Vera; Vygen, Jens; Zenklusen, Rico Reducing path TSP to TSP. (English) Zbl 07430748 SIAM J. Comput. 51, No. 3, STOC20-24-STOC20-53 (2022). MSC: 68W25 90C27 90C39 PDFBibTeX XMLCite \textit{V. Traub} et al., SIAM J. Comput. 51, No. 3, STOC20--24-STOC20--53 (2022; Zbl 07430748) Full Text: DOI
Köhne, Anna; Traub, Vera; Vygen, Jens The asymmetric traveling salesman path LP has constant integrality ratio. (English) Zbl 1450.90043 Math. Program. 183, No. 1-2 (B), 379-395 (2020). MSC: 90C27 68W25 05C85 PDFBibTeX XMLCite \textit{A. Köhne} et al., Math. Program. 183, No. 1--2 (B), 379--395 (2020; Zbl 1450.90043) Full Text: DOI arXiv
Gottschalk, Corinna; Vygen, Jens Better \(s-t\)-tours by Gao trees. (English) Zbl 1406.90105 Math. Program. 172, No. 1-2 (B), 191-207 (2018). MSC: 90C27 90C59 05C05 68Q25 68R05 PDFBibTeX XMLCite \textit{C. Gottschalk} and \textit{J. Vygen}, Math. Program. 172, No. 1--2 (B), 191--207 (2018; Zbl 1406.90105) Full Text: DOI
Gottschalk, Corinna; Vygen, Jens Better \(s\)-\(t\)-tours by Gao trees. (English) Zbl 1419.90094 Louveaux, Quentin (ed.) et al., Integer programming and combinatorial optimization. 18th international conference, IPCO 2016, Liège, Belgium, June 1–3, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9682, 126-137 (2016). MSC: 90C27 PDFBibTeX XMLCite \textit{C. Gottschalk} and \textit{J. Vygen}, Lect. Notes Comput. Sci. 9682, 126--137 (2016; Zbl 1419.90094) Full Text: DOI arXiv
Vygen, Jens Reassembling trees for the traveling salesman. (English) Zbl 1345.90079 SIAM J. Discrete Math. 30, No. 2, 875-894 (2016). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{J. Vygen}, SIAM J. Discrete Math. 30, No. 2, 875--894 (2016; Zbl 1345.90079) Full Text: DOI arXiv
Sebő, András; Vygen, Jens Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs. (English) Zbl 1340.90201 Combinatorica 34, No. 5, 597-629 (2014). Reviewer: Reinhardt Euler (Brest) MSC: 90C27 90C35 05C85 68R10 PDFBibTeX XMLCite \textit{A. Sebő} and \textit{J. Vygen}, Combinatorica 34, No. 5, 597--629 (2014; Zbl 1340.90201) Full Text: DOI arXiv