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

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-610881

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.