A Polynomial Time Algorithm for The Traveling Salesman Problem

Simple item page
dc.creatorGubin, Sergey
dc.date2006-10-09
dc.date2008-09-25
dc.date.accessioned2026-07-07T10:16:53Z
dc.date.available2026-07-07T10:16:53Z
dc.descriptionThe ATSP polytope can be expressed by asymmetric polynomial size linear program.
dc.description8 pages. Simplified
dc.identifierhttps://arxiv.org/abs/cs/0610042
dc.identifierhttp://arxiv.org/abs/cs/0610042
dc.identifierComplementary to Yannakakis' Theorem, 22nd MCCCC, University of Nevada, Las Vegas, 2008, p.8
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173669
dc.subjectDiscrete Mathematics
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.subjectF.2.0; G.2.1; G.2.2
dc.titleA Polynomial Time Algorithm for The Traveling Salesman Problem
dc.typetext

Files

Collections

arXiv