Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Efficient scheduling of Internet banner advertisements
ACM Transactions on Internet Technology (TOIT)
Performance bounds of algorithms for scheduling advertisements on a web page
Journal of Scheduling
Approximating the Advertisement Placement Problem
Journal of Scheduling
Scheduling Banner Advertisements on the Web
INFORMS Journal on Computing
Scheduling Web Advertisements: A Note on the Minspace Problem
Journal of Scheduling
Allocation of Multiple Advertisement on Limited Space: Heuristic Approach
FMN '09 Proceedings of the 2nd International Workshop on Future Multimedia Networking
An improved web system for pixel advertising
EC-Web'06 Proceedings of the 7th international conference on E-Commerce and Web Technologies
Maximizing revenue with allocation of multiple advertisements on a Web banner
Computers and Operations Research
Hi-index | 0.01 |
Pixel advertisement represents the presentation of small advertisements on a banner. With the Web becoming more important for marketing purposes, pixel advertisement is an interesting development. In this paper, we present a comparison of three heuristic algorithms for generating allocation patterns for pixel advertisements. The algorithms used are the orthogonal algorithm, the left justified algorithm, and the GRASP constructive algorithm. We present the results of an extensive simulation in which we have experimented with the sorting of advertisements and different banner and advertisement sizes. The purpose is to find a pattern generating algorithm that maximizes the revenue of the allocated pixel advertisements on a banner. Results show that the best algorithm for our goal is the orthogonal algorithm. We also present a Web application in which the most suitable algorithm is implemented. This Web application returns an allocation pattern for a set of advertisements provided by the user.