Constructing competitive tours from local information

doi:10.1016/0304-3975(94)90155-4

Theoretical Computer Science

Volume 130, Issue 1, 1 August 1994, Pages 125-138

https://doi.org/10.1016/0304-3975(94)90155-4 Get rights and content

Under an Elsevier user license

open archive

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.

Cited by (0)

^∗: Supported in part by NSF under grants CCR-9009318 and CCR-9202158.

^∗∗: Supported in part by NSF under grant CCR-9209283.