Scheduling Web Advertisements: A Note on the Minspace Problem

  • Authors:

  • Milind Dawande;Subodha Kumar;Chelliah Sriskandarajah

  • Affiliations:

  • University of Texas at Dallas, Richardson, USA 75080;University of Washington, Business School, Seattle, USA 98195;University of Texas at Dallas, Richardson, USA 75080

  • Venue:
  • Journal of Scheduling
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Free services to internet users are commonly available on many web sites e.g., Hotmail and Yahoo. For such sites, revenue generated from advertisements (hereafter also called 驴ads驴) placed on the web pages is critical for survival. An effective way to schedule ads on web pages to optimize certain performance measures is an important problem that these sites need to address.In this note, we report improved approximation algorithms for the following problem: ads from a set of n ads A = {Ai,...,An} are to be placed on a web page during a planning horizon that is divided into N time intervals. In each time interval, ads are shown in a rectangular space called a slot. An ad Ai is specified by its size si and frequency wi and is to be scheduled in exactly wi slots. We are required to find a schedule that minimizes the maximum fullness among all the slots, where the fullness of a slot is the sum of the sizes of ads scheduled in that slot. Our results include (i) the first online algorithm with a performance bound of $$2 - \frac{1}{N}$$ , and (ii) two offline algorithms with performance guarantees of $$1 + 1\frac{1}{\sqrt{2}}$$ and $$\frac{3}{2}$$]] , respectively. These bounds are significant improvements over those for previously known algorithms presented in Adler, Gibbons, and Matias (2002) and Dawande, Kumar, and Sriskandarajah (2003).