Grange, A., Kacem, I., Martin, S., & Minich, S. (2023). Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles. R.A.I.R.O. Recherche opérationnelle, 57(1), 1-16. https://doi.org/10.1051/ro/2022022
Citace podle Chicago (17th ed.)Grange, Aristide, Imed Kacem, Sébastien Martin, a Sarah Minich. "Fully Polynomial Time Approximation Scheme for the Pagination Problem with Hierarchical Structure of Tiles." R.A.I.R.O. Recherche Opérationnelle 57, no. 1 (2023): 1-16. https://doi.org/10.1051/ro/2022022.
Citace podle MLA (9th ed.)Grange, Aristide, et al. "Fully Polynomial Time Approximation Scheme for the Pagination Problem with Hierarchical Structure of Tiles." R.A.I.R.O. Recherche Opérationnelle, vol. 57, no. 1, 2023, pp. 1-16, https://doi.org/10.1051/ro/2022022.