Comparing the hardness of online minimization and maximization problems with predictions (Q6897303)
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 8124302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing the hardness of online minimization and maximization problems with predictions |
scientific article; zbMATH DE number 8124302 |
Statements
Comparing the hardness of online minimization and maximization problems with predictions (English)
0 references
20 November 2025
0 references
online algorithms with predictions
0 references
complexity theory
0 references
minimization vs maximization
0 references
independent set
0 references
