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.
CITATION STYLE
Kalyanasundaram, B., & Pruhs, K. R. (1993). Constructing competitive tours from local information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 700 LNCS, pp. 102–113). Springer Verlag. https://doi.org/10.1007/3-540-56939-1_65
Mendeley helps you to discover research relevant for your work.