Constructing Competitive Tours from Local Information

Abstract We consider the problem of a searcher exploring an initially unknown weighted planar graph G. When the searcher visits a vertex v, it learns of each edge incident to v. The searcher's goal is to visit each vertex of G, incurring as little cost as possible. We present a constant competitive algorithm for this problem.

[1]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  Amos Fiat,et al.  Online Navigation in a Room , 1992, J. Algorithms.

[3]  Yuval Rabani,et al.  Competitive algorithms for layered graph traversal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[5]  Rolf Klein,et al.  Walking an unknown street with bounded detour , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[6]  Bala Kalyanasundaram,et al.  Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane , 1994, Theor. Comput. Sci..

[7]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[8]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[9]  Gautam Das,et al.  WHICH TRIANGULATIONS APPROXIMATE THE COMPLETE GRAPH? , 2022 .

[10]  Bala Kalyanasundaram,et al.  Constructing Competitive Tours from Local Information , 1993, Theor. Comput. Sci..

[11]  Barun Chandra,et al.  Constructing Reliable Communication Networks of Small Weight Online , 1995, J. Algorithms.

[12]  Noga Alon,et al.  On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[13]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, ICALP.

[14]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[15]  Yossi Azar.  Lower Bounds for Insertion Methods for TSP , 1994, Comb. Probab. Comput..

[16]  Xiaotie Deng,et al.  How to learn an unknown environment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  Yuval Rabani,et al.  Lower bounds for randomized k-server and motion-planning algorithms , 1991, STOC '91.

[18]  Andrzej Lingas,et al.  Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees , 1989, Optimal Algorithms.

[19]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[20]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[21]  John J. Bartholdi,et al.  Spacefilling curves and the planar travelling salesman problem , 1989, JACM.