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 verti...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-02
Hauptverfasser:	Birx, Alexander, Disser, Yann, Hopp, Alexander V, Karousatou, Christina
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Exploration Graph theory Lower bounds Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!