Performance bounds of algorithms for scheduling advertisements on a web page

DOI10.1023/A:1024060710627zbMath1027.90029OpenAlexW1603910973MaRDI 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

zbMATH Keywords

schedulingapproximation algorithmsinternet advertisingperformance bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Marketing, advertising (90B60)

Related Items (8)

A polynomial-time approximation scheme for the MAXSPACE advertisement problem ⋮ Balancing perfectly periodic service schedules: An application from recycling and waste management ⋮ Unnamed Item ⋮ Scheduling web advertisements: a note on the minspace problem ⋮ Maximizing revenue with allocation of multiple advertisements on a Web banner ⋮ Unnamed Item ⋮ Advertisement revenue management: determining the optimal mix of skippable and non-skippable AdS for online video sharing platforms ⋮ Dynamic pricing and advertising for web content providers

This page was built for publication: Performance bounds of algorithms for scheduling advertisements on a web page