Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem
Computational Complexity
2008-01-04 v1
Abstract
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's evaluation of the algorithm.
Keywords
Cite
@article{arxiv.0801.0474,
title = {Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem},
author = {Christopher Clingerman and Jeremiah Hemphill and Corey Proscia},
journal= {arXiv preprint arXiv:0801.0474},
year = {2008}
}
Comments
10 pages, 8 figures, references arXiv:cs/0702133