Solution Bounds for a Hypothetical Polynomial Time Aproximation Algorithm for the TSP
Yaneff, A. G.
Original · EN
Bounds for the optimal tour length for a hypothetical TSP algorithm are derived.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.