Performance bounds of algorithms for scheduling advertisements on a web page
From MaRDI portal
Publication:1404272
DOI10.1023/A:1024060710627zbMath1027.90029MaRDI QIDQ1404272
Subodha Kumar, Chelliah Skriskandarajah, Milind W. Dawande
Publication date: 21 August 2003
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1024060710627
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
68W25: Approximation algorithms
90B60: Marketing, advertising
Related Items
Unnamed Item, Maximizing revenue with allocation of multiple advertisements on a Web banner, Scheduling web advertisements: a note on the minspace problem, Dynamic pricing and advertising for web content providers, Advertisement revenue management: determining the optimal mix of skippable and non-skippable AdS for online video sharing platforms, A polynomial-time approximation scheme for the MAXSPACE advertisement problem, Unnamed Item, Balancing perfectly periodic service schedules: An application from recycling and waste management