Title of article :
Scheduling Advertisements on a Web Page: New and Improved Approximation Algorithms
Author/Authors :
Dawande، نويسنده , , Milind and Kumar، نويسنده , , Subodha and Sriskandarajah، نويسنده , , Chelliah، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
We develop approximation algorithms for solving two problems, MINSPACE and MAXSPACE, which are shown to be strongly NP-Hard [2]. For the MINSPACE problem, two algorithms are provided: one with a performance guarantee of 2 and the other with a performance guarantee better than 2. For the MAXSPACE problem, two algorithms are developed with performance guarantees of 1/4 and 3/10.
Keywords :
Internet advertising , Scheduling , Performance Bounds , Algorithms
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
