Online Graph Exploration on Trees, Unicyclic Graphs and Cactus Graphs
share
We study the problem of exploring all vertices of an undirected weighted graph that is initially unknown to the searcher. An edge of the graph is only revealed when the searcher visits one of its endpoints. Beginning at some start node, the searcher's goal is to visit every vertex of the graph before returning to the start node on a tour as short as possible. We prove that the Nearest Neighbor algorithm's competitive ratio on trees with n vertices is Θ(log n), i.e. no better than on general graphs. This also yields a lower bound on the quality of the Nearest Neighbor heuristic for the traveling salesperson problem on trees. Furthermore, we examine the algorithm Blocking for a range of parameters not considered previously and prove it is 3-competitive on unicyclic graphs as well as 5/2+√(2)≈ 3.91-competitive on cactus graphs. The best-known lower bound for these two graph classes is 2.
READ FULL TEXT
