Approximation hardness of graphic TSP on cubic graphs
RAIRO-Oper. Res., 49 4 (2015) 651-668
Published online: 2015-03-27
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs
Vera Traub and Jens VygenSIAM Journal on Computing 52 (6) FOCS18-37 (2023)
https://doi.org/10.1137/18M1227135
Approximating TSP walks in subcubic graphs
Michael C. Wigal, Youngho Yoo and Xingxing YuJournal of Combinatorial Theory, Series B 158 70 (2023)
https://doi.org/10.1016/j.jctb.2022.09.002
766 (2018)
https://doi.org/10.1109/FOCS.2018.00078
New inapproximability bounds for TSP
Marek Karpinski, Michael Lampis and Richard SchmiedJournal of Computer and System Sciences 81 (8) 1665 (2015)
https://doi.org/10.1016/j.jcss.2015.06.003
Fundamentals of Computation Theory
Marek KarpinskiLecture Notes in Computer Science, Fundamentals of Computation Theory 9210 3 (2015)
https://doi.org/10.1007/978-3-319-22177-9_1