Improved Lower Bound for Competitive Graph Exploration

25 Feb 2020 Birx Alexander Disser Yann Hopp Alexander V. Karousatou Christina

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • OPTIMIZATION AND CONTROL