Relaxing the irrevocability requirement for online graph algorithms (Q6830296)
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 7549526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relaxing the irrevocability requirement for online graph algorithms |
scientific article; zbMATH DE number 7549526 |
Statements
Relaxing the irrevocability requirement for online graph algorithms (English)
0 references
28 June 2022
0 references
online algorithms
0 references
graph algorithms
0 references
competitive analysis
0 references
preemption
0 references
recourse
0 references
