Vladimir G. Deineko, Alexander Tiskin. Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?. ACM Journal of Experimental Algorithmics, 14, 2009. [doi]
@article{DeinekoT09-0,
title = {Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?},
author = {Vladimir G. Deineko and Alexander Tiskin},
year = {2009},
doi = {10.1145/1498698.1594232},
url = {http://doi.acm.org/10.1145/1498698.1594232},
researchr = {https://researchr.org/publication/DeinekoT09-0},
cites = {0},
citedby = {0},
journal = {ACM Journal of Experimental Algorithmics},
volume = {14},
}