A Polynomial Time Algorithm for The Traveling Salesman Problem
<|reference_start|>A Polynomial Time Algorithm for The Traveling Salesman Problem: The ATSP polytope can be expressed by asymmetric polynomial size linear program.<|reference_end|>
@article{gubin2006a,
    title={A Polynomial Time Algorithm for The Traveling Salesman Problem},
    author={Sergey Gubin},
    journal={Complementary to Yannakakis' Theorem, 22nd MCCCC, University of
  Nevada, Las Vegas, 2008, p.8},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0610042},
    primaryClass={cs.DM cs.CC cs.DS}
}