Abstract
In view of the fact that an /spl epsi/-optimal tour can be found in the Euclidean case in time that it is polynomial with a fixed degree, independent of /spl epsi/, it seems natural to ask whether the same holds true for the planar case. We give an algorithm requiring O(c/sup 1/c2/ n) time to find an /spl epsi/-optimal traveling salesman tour in the metric defined by a planar graph with nonnegative edge-lengths.
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.
