Abstract
This paper discusses a framework and provides an overview of general methods for optimizing the management of advertisements on web servers. We discuss the major issues which arise in web advertisement management, and describe basic mathematical techniques which can be employed to handle such problems. These include a number of statistical, optimization and scheduling models.
Chapter PDF
Keywords
- Minimum Cost Flow
- Round Robin Fashion
- Minimum Cost Flow Problem
- Statistical Data Collection
- Site Administrator
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ahuja, R., T. Magnanti, and J. Orlin, “Network Flows”, Prentice Hall, 1993.
Press W., S. Teukolsky, W. Vetterling, and B. Flannery, “Numerical Recipes in C”, Cambridge University Press, 1992.
Welz G., “New Deals”, Internet World, April 1995, pp. 36–41.
Welz G., “The Ad Game”, http://www.iw.com/1996/07/adgame.html.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aggarwal, C.C., Wolf, J.L., Yu, P.S. (1998). A framework for the optimizing of WWW advertising. In: Lamersdorf, W., Merz, M. (eds) Trends in Distributed Systems for Electronic Commerce. TREC 1998. Lecture Notes in Computer Science, vol 1402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053397
Download citation
DOI: https://doi.org/10.1007/BFb0053397
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64564-1
Online ISBN: 978-3-540-69433-5
eBook Packages: Springer Book Archive