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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
10 pages, 8 figures, references arXiv:cs/0702133

Keywords

Computational Complexity, F.2.1; G.1.6; I.2.8

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/145230

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0801.0474
 http://arxiv.org/abs/0801.0474

Collections

arXiv