Advertisement

Approximating the Advertisement Placement Problem

  • Freund Ari 
  • Naor Joseph Seffi 
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2337)

Abstract

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.

Keywords

Approximation Algorithm Time Slot Placement Problem Display Area Fully Polynomial Time Approximation Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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
  3. 3.
    Lawler, E.: Sequencing to minimize the weighted number of tardy jobs. Recherche Operationnel 10 (1976) 27–33MathSciNetzbMATHGoogle Scholar
  4. 4.
    Kise, H., Ibaraki, T., Mine, H.: A solvable case of one machine scheduling problem with ready and due dates. Operations Research 26 (1978) 121–126MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Lawler, E.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research 26 (1990) 125–133MathSciNetzbMATHCrossRefGoogle Scholar
  6. 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. 7.
    Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer-Verlag (1999)Google Scholar
  8. 8.
    Graham, R.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45 (1966) 1563–1581Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Freund Ari 
    • 1
  • Naor Joseph Seffi 
    • 1
  1. 1.Department of Computer ScienceTechnionHaifaIsrael

Personalised recommendations