Approximation algorithms for the MAXSPACE advertisement problem

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

In MAXSPACE, given a set of ads $\cala$, one wants to schedule a subset ${\cala'\subseteq\cala}$ into $K$ slots $B_1,\dots ,B_K$ of size $L$. E…