Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles
The pagination problem is described as follows. We have a set of symbols, a collection of subsets over these symbols (we call these subsets the tiles) and an integer capacity C . The objective is to find the minimal number of pages (a type of container) on which we can schedule all the tiles while f...
Saved in:
| Published in: | R.A.I.R.O. Recherche opérationnelle Vol. 57; no. 1; pp. 1 - 16 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.01.2023
|
| ISSN: | 0399-0559, 2804-7303 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!