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

Simple item page
dc.creatorYaneff, A. G.
dc.date2002-11-25
dc.date2003-01-25
dc.date.accessioned2026-07-07T03:19:02Z
dc.date.available2026-07-07T03:19:02Z
dc.descriptionBounds for the optimal tour length for a hypothetical TSP algorithm are derived.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/cs/0211032
dc.identifierhttp://arxiv.org/abs/cs/0211032
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31356
dc.subjectComputational Complexity
dc.subjectF.2.2; G.2.2
dc.titleSolution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP
dc.typetext

Files

Collections

arXiv