Approximating the advertisement placement problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2086937
- Scheduling space-sharing for internet advertising
- Scheduling web advertisements: a note on the minspace problem
- Performance bounds of algorithms for scheduling advertisements on a web page
- Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms
Cited in
(19)- Approximation algorithms for orthogonal packing problems for hypercubes
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
- Approximation algorithms for the MAXSPACE advertisement problem
- A System Point Approach to Nonuniform Advertising Insertions
- scientific article; zbMATH DE number 2086937 (Why is no real title available?)
- Prompt mechanism for ad placement over time
- Adaptive large neighborhood search for solving the circle bin packing problem
- Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms
- scientific article; zbMATH DE number 1479855 (Why is no real title available?)
- Two for one: tight approximation of 2D bin packing
- Maximally representative allocations for guaranteed delivery advertising campaigns
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- Scheduling web advertisements: a note on the minspace problem
- Two for One: Tight Approximation of 2D Bin Packing
- scientific article; zbMATH DE number 2038780 (Why is no real title available?)
- Generalized assignment of time-sensitive item groups
- Two-agent advertisement scheduling on physical books to maximize the total profit
- Nonparametric advertising budget allocation with inventory constraint
- The preemptive resource allocation problem
This page was built for publication: Approximating the advertisement placement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464430)
