Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP
arXiv:cs/0211032
Abstract
Bounds for the optimal tour length for a hypothetical TSP algorithm are derived.
arXiv comment2 pages
arXiv:cs/0211032
Bounds for the optimal tour length for a hypothetical TSP algorithm are derived.
arXiv comment2 pages