Megow, Nicole; Mehlhorn, Kurt; Schweitzer, Pascal
We study the problem of exploring an unknown undirected connected graph. Beginning in some start vertex, a searcher must visit each node of the graph by traversing edges. Upon visiting a vertex for the first time, the searcher learns all incident edges and their respective traversal costs. The goal is to find a tour of minimum total cost. Kalyanasundaram and Pruhs (Constructing competitive tours from local information, Theoretical Computer Science 130, pp. 125-138, 1994) proposed a...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.