Approximating the Advertisement Placement Problem
The advertisement placement problem deals with space and time sharing by advertisements on the Internet. Consider a WWW page containing a rectangular display area (e.g., a banner) in which advertisements may appear. The display area can be utilized efficiently by allowing several small advertisements to appear simultaneously side by side, as well as by cycling through a schedule of ads, displaying different ads at different times. A customer wishing to purchase advertising space specifies an ad size and a display count, which is the number of times his advertisement should appear during each cycle. The scheduler may accept or reject any given advertisement, but must be able to schedule all accepted ones within the given time and space constraints, while honoring the display count of each. The objective is to schedule a maximum-profit subset of ads. We present a (3 + ε)-approximation algorithm for the general problem, as well as (2 + ε)-approximation algorithms for two special cases.
KeywordsApproximation Algorithm Time Slot Placement Problem Display Area Fully Polynomial Time Approximation Scheme
Unable to display preview. Download preview PDF.
- 1.Adler, M., Gibbons, P., Matias, Y.: Scheduling space-sharing for internet advertising. Journal of Scheduling (to appear). Also available electronically at http://www.cs.umass.edu/~micah/pubs/pubs.html.
- 2.Lawler, E., Lenstra, J., Rinnooy Kan, A., Shmoys., D.: Sequencing and scheduling: algorithms and complexity. In Graves, S., Rinnooy Kan, A., Zipkin, P., eds.: Handbooks in Operations Research and Management Science, Vol.4: Logistics for Production and Inventory. North Holland (1993) 445–522Google Scholar
- 6.Dawadne, M., Kumar, S., Srishkandarajah, C.: Performance bounds of algorithms for scheduling advertisements on a web page. Working paper (2001). Available at http://www.utdallas.edu/~chelliah/wpapers.html.
- 7.Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer-Verlag (1999)Google Scholar
- 8.Graham, R.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45 (1966) 1563–1581Google Scholar