Constructing Competitive ToursFrom Local

  title={Constructing Competitive ToursFrom Local},
  author={InformationBala Kalyanasundaram and USAKirk R. Pruhs},
  • InformationBala Kalyanasundaram, USAKirk R. Pruhs
  • Published 1994
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.