Birx, A. ; Disser, Y. ; Hopp, A. ; Karousatou, C. (2021)
An Improved Lower Bound for Competitive Graph Exploration.
In: Theoretical Computer Science, 868
doi: 10.1016/j.tcs.2021.04.003
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
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. and also holds for planar graphs, where it complements an upper bound of 16 by Megow et al. . The question whether a constant competitive ratio can be achieved in general remains open.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2021 |
| Autor(en): | Birx, A. ; Disser, Y. ; Hopp, A. ; Karousatou, C. |
| Art des Eintrags: | Bibliographie |
| Titel: | An Improved Lower Bound for Competitive Graph Exploration |
| Sprache: | Englisch |
| Publikationsjahr: | 8 Mai 2021 |
| Verlag: | Elsevier |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Theoretical Computer Science |
| Jahrgang/Volume einer Zeitschrift: | 868 |
| DOI: | 10.1016/j.tcs.2021.04.003 |
| URL / URN: | https://www.sciencedirect.com/science/article/abs/pii/S03043... |
| Kurzbeschreibung (Abstract): | 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. and also holds for planar graphs, where it complements an upper bound of 16 by Megow et al. . The question whether a constant competitive ratio can be achieved in general remains open. |
| Fachbereich(e)/-gebiet(e): | Exzellenzinitiative Exzellenzinitiative > Graduiertenschulen Exzellenzinitiative > Graduiertenschulen > Graduate School of Computational Engineering (CE) |
| Hinterlegungsdatum: | 15 Jul 2022 06:58 |
| Letzte Änderung: | 15 Jul 2022 06:58 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum