An improved lower bound for competitive graph exploration (Q831137)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7346935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved lower bound for competitive graph exploration |
scientific article; zbMATH DE number 7346935 |
Statements
An improved lower bound for competitive graph exploration (English)
0 references
10 May 2021
0 references
graph exploration
0 references
online algorithms
0 references
competitive analysis
0 references
competitive ratio
0 references
0 references
0.8326119184494019
0 references
0.8309927582740784
0 references
0.8292017579078674
0 references
0.8269595503807068
0 references
0.8123018145561218
0 references
