Performance bounds of algorithms for scheduling advertisements on a web page

Journal of Scheduling

Volumn 6, Issue 4, 2003, Pages 373-394

  Dawande, Milind ^a,b   Kumar, Subodha ^c   Sriskandarajah, Chelliah ^a  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Approximation algorithms; Internet advertising; Performance bounds; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; INTERNET; MARKETING; PERFORMANCE; WEBSITES;

APPROXIMATION ALGORITHMS; BUSINESS MODELS; INTERNET ADVERTIZING; PERFORMANCE BOUNDS;

SCHEDULING;

EID: 3543073492     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024060710627     Document Type: Article

References (29)

1. AdKnowledge System, Engage AdKnowledge Online Advertising Report, http://www.e-biznes.pl/download/ oar_3rdqtr00.pdf, 2000.
2. Adler, M., P. B. Gibbons, and Y. Matias, "Scheduling space-sharing for internet advertising," J. Sched., 5, 103-119 (2002).
3. Aggarwal, C. C., J. L. Wolf, and P. S. Yu, "A framework for the optimizing of WWW advertising," Trends Dist. Syst. Electron. Comm., 00, 1-10 (1998).
4. Chen, B., C. N. Potts, G. Woeginger, "A review of machine scheduling: Complexity, algorithms and approximability," in D. Z. Du and P. M. Pardalos (ed.), Handbook of Combinatorial Optimization, vol. 3, Kluwer, Dordrecht, The Netherlands, 1998, pp. 21-169.
5. Coffman, E. G. Jr, M. R. Garey, D. S. Johnson, "An application of bin-packing to multiprocessor scheduling," SIAM J. Comput., 7(1), 1-17 (1978).
6. Coffman, E. G., M. R. Garey, and D. S. Johnson, "Approximation algorithms for bin-packing: A survey," in D. S. Hochbaum (ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, pp. 46-93, 1997.
7. cybereps.com, http://www.cybereps.com/MKcollegeclub.shtml.
8. Friesen, D. K., "Tighter bounds for multifit processor scheduling algorithm," SIAM J. Comput., 13, 170-181 (1984).
9. Friesen, D. K. M. A. Langsten, "Evaluation of a multifit-based scheduling algorithm," J. Algorithms, 7, 35-59 (1986).
10. Garfinkel, R. S. G. L. Nemhauser, Integer Programming, Wiley and Sons Ltd., New York, 1972.
11. Garey, M. R., and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
12. Graham, R. L., "Bounds on multiprocessing timing anomalies," SIAM. J. Appl. Math., 17, 416-429 (1969).
13. Hochbaum, D. S., and D. B. Shmoys, "Using dual approximation algorithms for scheduling problems: Theoretical and practical results," J. Assoc. Comput. Mach., 34, 144-162 (1987).
14. Ibarra, O. H., and C. E. Kim, "Fast approximation algorithms for the knapsack and sum of subset problems," J. Assoc. Comput. Mach., 22, 463-468 (1975).
15. Interactive Advertising Bureau, http://www.iab.net.
16. Jupiter Communications, The 1997 Online Kids Report, http://www.jup.com, 1997.
17. Kalakota, R. and A. B. Whinston, Electronic Commerce: A Manager's Guide, Addison Wesley Longman, Inc., 1997.
18. Lawler, E. L. and J. M. Moore, "A functional equation and its application to resource allocation and sequencing problems," Manage. Sci., 16, 77-84 (1969).
19. 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 et al. (eds.), Handbooks in Operations Research and Management Science, vol. 4, 1993, pp. 445-552.
20. Martello, S. and P. Toth, Knapsack Problems, John Wiley and Sons Ltd., New York, 1989.
21. Martin, R. K., Large Scale Linear and Integer Optimization., Kluwer, Massachusetts, 1999.
22. McCandless, M., "Web advertising," IEEE Intelligent Sys., (1998). May/June p. 8-9
23. McGuire, T., "Internet: A stream of light," Intermedia, 29, 19-21 (2001).
24. Novak, T. P., and D. L. Hoffman, "New metrics for new media: Toward the development of web measurement standards," World Wide Web J., III(I), Winter, (1997).
25. Nemhauser, G. L., and L. A. Wolsey, Integer Programming and Combinatorial Optimization, Wiley, New York, 1988.
26. Pinedo, M., Scheduling Theory, Algorithms, and Systems, Prentice Hall, NJ, 1995.
27. Rothkopf, M. H., "Scheduling independent tasks on parallel processors," Manage. Sci., 12, 437-447 (1966).
28. wheelsdirect2u.com, http://www.wheelsdirect2u.com/target_marketing.htm.
29. Yager, R. R., "Intelligent agents for world wide web advertising decisions," Int. J. Intelligent Sys., 12, 379-390 (1997).