Constructing competitive tours from local information
- 1 August 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 130 (1) , 125-138
- https://doi.org/10.1016/0304-3975(94)90155-4
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Constructing competitive tours from local informationTheoretical Computer Science, 1994
- Not all insertion methods yield constant approximate tours in the Euclidean planeTheoretical Computer Science, 1994
- On-line Steiner trees in the Euclidean planePublished by Association for Computing Machinery (ACM) ,1992
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenesPublished by Springer Nature ,1992
- Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics, 1991
- Spacefilling curves and the planar travelling salesman problemJournal of the ACM, 1989
- There are planar graphs almost as good as the complete graphs and as short as minimum spanning treesPublished by Springer Nature ,1989
- Which triangulations approximate the complete graph?Published by Springer Nature ,1989
- Shortest paths without a mapPublished by Springer Nature ,1989
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977