Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Fully polynomial time approximation scheme for the pagination problem with ..."

Aristide Grange et al. (2023)

> Home

Details and statistics

DOI: 10.1051/RO/2022022

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rairo/GrangeKMM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/GrangeKMM23
Aristide Grange, Imed Kacem, Sébastien Martin, Sarah Minich:
Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles. RAIRO Oper. Res. 57(1): 1-16 (2023)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.