Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Bounds for the optimal tour length for a hypothetical TSP algorithm are derived.
2 pages

Keywords

Computational Complexity, F.2.2; G.2.2

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0211032
 http://arxiv.org/abs/cs/0211032

Collections

arXiv