A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem.

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

Published in: LAGOS (2019)

Keyphrases

polynomial time approximation
approximation algorithms
np hard
error bounds
vertex cover
bin packing
identical machines