Approximation algorithms for Metric TSP
Posted by Alex Golovnev, at cstheory.stackexchange.com,
It is known that metric TSP can be approximated within $1.5$ and cannot be approximated better than $123\over 122$ in…
It is known that metric TSP can be approximated within $1.5$ and cannot be approximated better than $123\over 122$ in…
Factoring and graph isomorphism are problems in NP that are not known to be in P nor to be NP-Complete. What are some other (suf…