Approximating the advertisement placement problem

Journal of Scheduling

Volumn 7, Issue 5, 2004, Pages 365-374

  Freund, Ari ^a   Naor, Joseph ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; Scheduling; Web advertising

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MARKETING; PROBLEM SOLVING; VIDEO CONFERENCING; WORLD WIDE WEB;

APPROXIMATION ALGORITHMS; NON-NEGATIVE PROFITS; TIME SHARING; WEB-ADVERTISING;

SCHEDULING;

EID: 4043153557     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOSH.0000036860.90818.5f     Document Type: Article

References (9)

1. Adler, M., P. B. Gibbons, and Y. Matias, "Scheduling space-sharing for Internet advertising," Journal of Scheduling, 5(2), 103-119 (2002).
2. Ausiello, G., P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation, Springer-Verlag, 1999.
3. Dawande, M., S. Kumar, and C. Sriskandarajah, "Performance bounds of algorithms for scheduling advertisements on a web page," Working paper 2001.
4. Graham, R. L., "Bounds for certain multiprocessing anomalies," Bell System Technical Journal, 45, 1563-1581 (1966).
5. Jansen, K., "On preemptive resource constrained scheduling: Polynomial time approximation schemes," in Proc. 9th Conference on Integer Programming and Combinatorial Optimization, vol. 2337 of Lecture Notes in Computer Science, Springer, 2002, pp. 329-349.
6. Kise, H., T. Ibaraki, and H. Mine, "A solvable case of one machine scheduling problem with ready and due dates," Operations Research, 26, 121-126 (1978).
7. Lawler, E. L., "Sequencing to minimize the weighted number of tardy jobs," Recherche Operationnel, 10, 27-33 (1976).
8. Lawler, E. L., "A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs," Annals of Operations Research 26, 125-133 (1990).
9. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, "Sequencing and scheduling: Algorithms and complexity," in S. C. Graves, A. H. G. Rinnooy Kan and P. H. Zipkin, (eds.), Handbooks in Operations Research and Management Science, Volume 4: Logistics for Production and Inventory, North Holland, 1993, pp. 445-522.