Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP
<|reference_start|>Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP: Bounds for the optimal tour length for a hypothetical TSP algorithm are derived.<|reference_end|>
@article{yaneff2002solution,
    title={Solution Bounds for a Hypothetical Polynomial Time Aproximation
  Algorithm for the TSP},
    author={A. G. Yaneff},
    journal={arXiv preprint arXiv:cs/0211032},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0211032},
    primaryClass={cs.CC}
}