Scheduling web advertisements: a note on the minspace problem
From MaRDI portal
Publication:880489
DOI10.1007/s10951-005-5217-6zbMath1123.90021OpenAlexW2074220611MaRDI QIDQ880489
Subodha Kumar, Milind W. Dawande, Chelliah Skriskandarajah
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-005-5217-6
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Marketing, advertising (90B60)
Related Items (6)
Maximizing revenue with allocation of multiple advertisements on a Web banner ⋮ Unnamed Item ⋮ Adaptive large neighborhood search for solving the circle bin packing problem ⋮ Advertisement revenue management: determining the optimal mix of skippable and non-skippable AdS for online video sharing platforms ⋮ A Goal Programming Model for Selection and Scheduling of Advertisements on Online News Media ⋮ Dynamic pricing and advertising for web content providers
Cites Work
- Unnamed Item
- New algorithms for an ancient scheduling problem.
- Performance bounds of algorithms for scheduling advertisements on a web page
- On-line scheduling revisited
- Scheduling space-sharing for internet advertising
- Approximating the advertisement placement problem
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- Evaluation of a MULTIFIT-based scheduling algorithm
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- An Application of Bin-Packing to Multiprocessor Scheduling
- Better Bounds for Online Scheduling
- A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
- A Better Algorithm for an Ancient Scheduling Problem
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Scheduling web advertisements: a note on the minspace problem
