A polynomial-time approximation scheme for the MAXSPACE advertisement problem

DOI10.1016/j.entcs.2019.08.061OpenAlexW2978404549WikidataQ113317368 ScholiaQ113317368MaRDI QIDQ2132409

Rafael C. S. Schouery, Lehilton L. C. Pedrosa, Mauro R. C. da Silva

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.061

zbMATH Keywords

approximation algorithmPTASMAXSPACEscheduling of advertisements

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Performance bounds of algorithms for scheduling advertisements on a web page
• Scheduling space-sharing for internet advertising
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

This page was built for publication: A polynomial-time approximation scheme for the MAXSPACE advertisement problem