Advertisements scheduling problems

• Grant number: 17/21297-2
• Support Opportunities: Scholarships in Brazil - Master
• Start date: May 01, 2018
• End date: March 31, 2019
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Agreement: Coordination of Improvement of Higher Education Personnel (CAPES)
• Principal Investigator: Rafael Crivellari Saliba Schouery
• Grantee: Mauro Roberto Costa da Silva
• Host Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
• Associated research grant: 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points, AP.TEM

Abstract

The amount raised in advertising on the internet has grown a lot in the 21st century. The growth in the display of ads on the internet has created a multibillion-dollar industry, with one-third of all advertisements on the Internet being displayed on banners. This raises the question of how banner advertisements should be organized in order to maximize revenue. In this context, advertisements scheduling problems consist of arranging a set of advertisements in a banner B, where we have N time units called slots and in each time unit the advertisements of the corresponding slot are shown in B. We present the MAXSPACE and MINSPACE problems and perform a bibliographic review of both, considering exact algorithms, heuristics and approximation algorithms found in the literature. Next, we present which variants can be considered for the design of new algorithms for that problems. (AU)

Scientific publications

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

DA SILVA, MAURO R. C.; SCHOUERY, RAFAEL C. S.; PEDROSA, LEHILTON L. C.. A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, v. 346, p. 12-pg., 2019-08-30. (17/21297-2, 15/11937-9, 16/23552-7)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

SILVA, Mauro Roberto Costa da. Heuristics and approximation algorithms for scheduling advertisements problem. 2019. Master's Dissertation - Universidade Estadual de Campinas (UNICAMP). Instituto de Computação Campinas, SP.