Referenced Items are not available for this document.
In view of the fact that an ε-optimal tour can be found in the Euclidean case in time that it is polynomial with a fixed degree, independent of ε, it seems natural to ask whether the same holds true for the planar case. We give an algorithm requiring O(c1c2/ n) time to find an ε-optimal traveling salesman tour in the metric defined by a planar graph with nonnegative edge-lengths.
Published in:
Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on
Date of Conference: 23-25 Oct. 2005
- Page(s):
- 647 - 656
- Print ISBN:
- 0-7695-2468-0
- INSPEC Accession Number:
- 8803130
- Digital Object Identifier :
- 10.1109/SFCS.2005.7
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
