Loading [MathJax]/extensions/MathMenu.js
On the complexity of unique solutions | IEEE Conference Publication | IEEE Xplore

On the complexity of unique solutions


Abstract:

We show that the problem of deciding whether an instance of the traveling salesman problem has a uniquely optimal solution is complete for Δ2P.

Abstract:

We show that the problem of deciding whether an instance of the traveling salesman problem has a uniquely optimal solution is complete for Δ2P.
Date of Conference: 03-05 November 1982
Date Added to IEEE Xplore: 18 July 2008
Print ISSN: 0272-5428
Conference Location: Chicago, IL, USA

Contact IEEE to Subscribe

References

References is not available for this document.