Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles.
Aristide GrangeImed KacemSébastien MartinSarah MinichPublished in: RAIRO Oper. Res. (2023)
Keyphrases
- polynomial time approximation
- hierarchical structure
- np hard
- approximation algorithms
- error bounds
- hierarchical structures
- hierarchical organization
- hierarchically structured
- hierarchical classification
- tree structure
- bin packing
- web pages
- computational complexity
- feature selection
- information retrieval
- image representation
- approximation ratio
- feature extraction
- search engine