Fast Algorithms for Geometric Traveling Salesman Problems
This paper describes efficient algorithms for computing approximate traveling salesman tours in multidimensional point sets. We describe implementations of a dozen starting heur...
Publications
1 shownResearcher Info
- h-index
- 1
- Publications
- 1
- Citations
- 461
- Institution
- AT&T (United States)
External Links
Impact Metrics
h-index
1
h-index: Number of publications with at least h citations each.