Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles (Q5880965)
From MaRDI portal
scientific article; zbMATH DE number 7661204
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles |
scientific article; zbMATH DE number 7661204 |
Statements
Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles (English)
0 references
9 March 2023
0 references
approximation algorithms
0 references
scheduling
0 references
FPTAS
0 references
dynamic programming
0 references
