A Polynomial Time Algorithm for The Traveling Salesman Problem
Discrete Mathematics
2008-11-10 v3 Computational Complexity
Data Structures and Algorithms
Abstract
The ATSP polytope can be expressed by asymmetric polynomial size linear program.
Keywords
Cite
@article{arxiv.cs/0610042,
title = {A Polynomial Time Algorithm for The Traveling Salesman Problem},
author = {Sergey Gubin},
journal= {arXiv preprint arXiv:cs/0610042},
year = {2008}
}
Comments
8 pages. Simplified