Approximating the advertisement placement problem

DOI10.1007/3-540-47867-1_29MaRDI QIDQ4737542zbMATH OpenFDO

Authors Ari Freund, Joseph (Seffi) Naor

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370415.htm

Mathematics Subject Classification ID

Marketing, advertising (90B60) Discrete location and assignment (90B80)

Recommendations

• Approximating the advertisement placement problem
• A polynomial-time approximation scheme for the MAXSPACE advertisement problem
• Improved approximation algorithms for minimum-space advertisement scheduling
• A mathematical programming study of advertising allocation problem.
• The adwords problem with strict capacity constraints
• A linear programming approach for determining optimal advertising policy
• A hybrid algorithm for the adwords problem
• On a discrete model of optimal advertising

Cited in

(16)

• Hardness of approximation for orthogonal rectangle packing and covering problems
• A polynomial-time approximation scheme for the MAXSPACE advertisement problem
• Nonparametric advertising budget allocation with inventory constraint
• Maximally representative allocations for guaranteed delivery advertising campaigns
• Approximating the advertisement placement problem
• Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms
• Prompt mechanism for ad placement over time
• A System Point Approach to Nonuniform Advertising Insertions
• Improved approximation algorithms for minimum-space advertisement scheduling
• scientific article; zbMATH DE number 1479855 (Why is no real title available?)
• Two-agent advertisement scheduling on physical books to maximize the total profit
• Maximizing revenue with allocation of multiple advertisements on a Web banner
• Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
• Approximation algorithms for the MAXSPACE advertisement problem
• Local-search based heuristics for advertisement scheduling
• Scheduling web advertisements: a note on the minspace 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 Q4737542)