• DOI:10.1023/A:1024060710627
Corpus ID: 36844407

Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page

@article{Dawande2003PerformanceBO,
  title={Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page},
  author={M. Dawande and S. Kumar and Chelliah Sriskandarajah},
  journal={Journal of Scheduling},
  year={2003},
  volume={6},
  pages={373-394}
}

M. Dawande, S. Kumar, Chelliah Sriskandarajah

Published 2003

Computer Science

Journal of Scheduling

AbstractConsider a set of n advertisements (hereafter called “ads”) A ={A1,...,An} competing to be placed in a planning horizon which is divided into N time intervals called slots. An ad Ai is specified by its size si and frequency wi. The size si represents the amount of space the ad occupies in a slot. Ad Ai is said to be scheduled if exactly wi copies of Ai are placed in the slots subject to the restriction that a slot contains at most one copy of an ad. In this paper, we consider two… CONTINUE READING

View on Springer

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed