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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.