Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem

Details Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem

2008-01-03

arxiv.org/abs/0801.0474v1

Computer Science

Computational Complexity

10 pages, 8 figures, references arXiv:cs/0702133

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-610881