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
    56 Citations

    Topics from this paper

    Scheduling Web Advertisements: A Note on the Minspace Problem
    • 25
    Scheduling Advertisements on a Web Page
    • 2
    Approximation algorithms for the MAXSPACE advertisement problem
    • Highly Influenced
    • PDF
    Local-Search Based Heuristics for Advertisement Scheduling
    • Highly Influenced
    • PDF
    Approximating the Advertisement Placement Problem
    • 27
    • PDF
    Approximating the Advertisement Placement Problem
    • 27
    Maximizing revenue with allocation of multiple advertisements on a Web banner
    • 15
    • PDF

    References

    SHOWING 1-10 OF 20 REFERENCES
    Using dual approximation algorithms for scheduling problems: Theoretical and practical results
    • D. Hochbaum, D. Shmoys
    • Mathematics, Computer Science
    • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
    • 1985
    • 683
    • PDF
    Scheduling Independent Tasks on Parallel Processors
    • 224
    Scheduling: Theory, Algorithms, and Systems
    • 6,026
    • PDF
    Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
    • 928
    Evaluation of a MULTIFIT-Based Scheduling Algorithm
    • 47
    Tighter Bounds for the Multifit Processor Scheduling Algorithm
    • 116