Abstract
The traveling salesman problem (TSP) is one of the hardest optimization problems in NPO because it does not admit any polynomial time approximation algorithm (unless P = NP). On the other hand we have a polynomial time approximation scheme (PTAS) for the Euclidean TSP and the 2 3 -approximation algorithm of Christofides for TSP instances satisfying the triangle inequality. The main contributions of this paper are the following:
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
