Scheduling web advertisements: A note on the minspace problem

Journal of Scheduling

Volumn 8, Issue 1, 2005, Pages 97-106

  Dawande, Millind ^a   Kumar, Subodha ^b   Sriskandarajah, Chelliah ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Approximation algorithms; Scheduling; Web advertising

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MARKETING; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; PERFORMANCE MEASURES; REVENUE; WEB ADVERTIZING;

WEBSITES;

EID: 17444428657     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-005-5217-6     Document Type: Conference Paper

References (18)

1. Adler, M., P. B. Gibbons, and Y. Matias, "Scheduling space-sharing for internet advertising," Journal of Scheduling, 5(2), 103-119 (2002).
2. Albers, S., "Better bounds for online scheduling," SIAM Journal on Computing, 29(2), 459-473 (1999).
3. Bartal, Y., A. Fiat, H. Karloff, and R. Vohra, "New algorithms for an ancient scheduling problem," Journal of Computer and System Sciences, 51, 359-366 (1995).
4. Chandrasekaran, R., B. Chen, G. Galambos, P. R. Narayanan, A. van Vilet, and G. J. Woeginger, "A note on' and on-line scheduling heuristic with better worst case ratio than Graham's list scheduling," SIAM Journal on Computing, 26(3), 870-872 (1997).
5. Coffman, Jr., E. G., M. R. Garey, and D. S. Johnson, "An application of bin-packing to multiprocessor scheduling," SIAM Journal of Computing, 7(1), 1-17 (1978).
6. Dawande, M., S. Kumar, and C. Sriskandarajah, "Performance bounds of algorithms for scheduling advertisements on a web page," Journal of Scheduling, 6, 373-393 (2003).
7. Fleischer, R. and M. Wahl, "On-line scheduling revisited," Journal of Scheduling, 3(6), 343-353 (2000).
8. Friesen, D. K., "Tighter bounds for multifit processor scheduling algorithm," SIAM Journal of Computing, 13, 170-181 (1984).
9. Friesen, D. K. and M. A. Langsten, "Evaluation of a multifit-based scheduling algorithm," Journal of Algorithms, 7, 35-59 (1986).
10. Fruend, A. and J. Naor, "Approximating the advertisement placement problem," Journal of Scheduling, 7, 365-374 (2004).
11. Galambos, G. and G. J. Woeginger, "An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling," SIAM Journal on Computing, 22(2), 349-355 (1993).
12. Graham, R. L., "Bounds on multiprocessing timing anomalies," SIAM Journal of Applied Mathematics, 17, 416-429 (1969).
13. Hochbaum, D. S. and D. B. Shmoys, "Using dual approximation algorithms for scheduling problems: Theoretical and practical results," Journal of the Association for Computing Machinery, 34, 144-162 (1987).
14. Hyland, T. "Why Internet advertising?" in Webvertising: The Ultimate Internet Advertising Guide, SCN Education B. V., Friedrich Viewag & Sohn, 2000, pp. 13-18.
15. Interactive Advertising Bureau, http://www.iab.net.
16. Karger, D. R., S. J. Phillips, and E. Torng, "A better algorithm for an ancient scheduling problem," Journal of Algorithms, 20(2), 400-430 (1996).
17. Martin, R. K., Large Scale Linear and Integer Optimization, Kluwer, Massachusetts, 1999.
18. Puetz, J., "A revolution in our midst," Satellite Communications, Atlanta, 24, 38 (2000).