Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?

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]

Authors

Vladimir G. Deineko

This author has not been identified. Look up 'Vladimir G. Deineko' in Google

Alexander Tiskin

This author has not been identified. Look up 'Alexander Tiskin' in Google