3 citations · 3 across the 1 of their papers we have counts for
1 paper
Christopher Clingerman, Jeremiah Hemphill, Corey Proscia
Yatsenko gives a polynomial-time algorithm for solving the traveling salesman problem. We examine the correctness of the algorithm and its construction. We also comment on Yatsenko…