Not all insertion methods yield constant approximate tours in the Euclidean plane
- 28 March 1994
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 125 (2) , 345-353
- https://doi.org/10.1016/0304-3975(94)90257-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics, 1991
- The relative neighbourhood graph of a finite planar setPattern Recognition, 1980
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977