An Improved Lower Bound For Competitive Graph Exploration

We give an improved lower bound of 10/3 on the competitive ratio for the exploration of an undirected, edge-weighted graph with a single agent that needs to return to the starting location after visiting all vertices. We assume that the agent has full knowledge of all edges incident to visited vertices, and, in particular, vertices have unique identifiers. Our bound improves a lower bound of 2.5 by Dobrev et al. [10] and also holds for planar graphs, where it complements an upper bound of 16 by Megow et al. [20]. The question whether a constant competitive ratio can be achieved in general remains open. (C) 2021 Elsevier B.V. All rights reserved.