Approximating the Advertisement Placement Problem

Authors:
Ari Freund;Joseph (Seffi) Naor
Affiliations:
IBM Haifa Labs, University Campus, Haifa 31905, Israel. arief@cs.technion.ac.il;Department of Computer Science, Technion, Haifa 32000, Israel
Venue:
Journal of Scheduling
Year:
2004

Citing 3
Cited 10

A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Annals of Operations Research
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

Scheduling Web Advertisements: A Note on the Minspace Problem

Journal of Scheduling
Discovering information diffusion paths from blogosphere for online advertising

Proceedings of the 1st international workshop on Data mining and audience intelligence for advertising
Markovian workload modeling for Enterprise Application Servers

C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Two for One: Tight Approximation of 2D Bin Packing

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Approximation algorithms for orthogonal packing problems for hypercubes

Theoretical Computer Science
Single Pattern Generating Heuristics for Pixel Advertisements

WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
Maximizing revenue with allocation of multiple advertisements on a Web banner

Computers and Operations Research
Hybrid genetic algorithm and augmented neural network application for solving the online advertisement scheduling problem with contextual targeting

Expert Systems with Applications: An International Journal
Approximating the orthogonal knapsack problem for hypercubes

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The impacts of media type, placement and exposure type on attitudes towards advertisements on mobile devices

International Journal of Mobile Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The advertisement placement problem deals with space and time sharing by advertisements on the Internet. Consider a Web page containing a rectangular display area (e.g., a banner) in which advertisements may appear. The display area can be utilized efficiently by allowing several small ads to appear simultaneously side by side, as well as by cycling through a schedule of ads, allowing different ads to be displayed at different times. A customer wishing to purchase advertising space specifies an ad size and a display count, which is the number of times their ad should appear during each cycle. The scheduler may accept or reject any given advertisement, but must be able to schedule all accepted ads within the given time and space constraints. Each advertisement has a non-negative profit associated with it, and the objective is to schedule a maximum-profit subset of ads. We present a (3 + ε)-approximation algorithm for the general problem, as well as (2 + ε)-approximation algorithms for two special cases.