Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles

DOI10.1051/RO/2022022OpenAlexW4211121299MaRDI QIDQ5880965

No author found.

Publication date: 9 March 2023

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2022022

zbMATH Keywords

schedulingdynamic programmingapproximation algorithmsFPTAS

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (1)

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan

This page was built for publication: Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles