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

Simple item page
dc.creatorClingerman, Christopher
dc.creatorHemphill, Jeremiah
dc.creatorProscia, Corey
dc.date2008-01-03
dc.date.accessioned2026-07-07T08:52:17Z
dc.date.available2026-07-07T08:52:17Z
dc.descriptionYatsenko 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.
dc.description10 pages, 8 figures, references arXiv:cs/0702133
dc.identifierhttps://arxiv.org/abs/0801.0474
dc.identifierhttp://arxiv.org/abs/0801.0474
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145230
dc.subjectComputational Complexity
dc.subjectF.2.1; G.1.6; I.2.8
dc.titleAnalysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem
dc.typetext

Files

Collections

arXiv