Work

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

Year: 2008

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.0801.0474

Authors: Clingerman, Christopher, Hemphill, Jeremiah, Proscia, Corey

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1709440492

Cites: 2

Cited by: 3

Related to: 10