Scheduling web advertisements: a note on the minspace problem

DOI10.1007/S10951-005-5217-6MaRDI QIDQ880489zbMATH OpenOpenAlexFDO

Authors Subodha Kumar, Milind Dawande, Chelliah Sriskandarajah

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

zbMATH Keywords

approximation algorithmsschedulingweb advertising

Mathematics Subject Classification ID

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

Recommendations

• Performance bounds of algorithms for scheduling advertisements on a web page
• Scheduling space-sharing for internet advertising
• scientific article; zbMATH DE number 2086937
• Approximating the advertisement placement problem
• Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms

Cites work

• A Better Algorithm for an Ancient Scheduling Problem
• A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
• An Application of Bin-Packing to Multiprocessor Scheduling
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• Approximating the advertisement placement problem
• Better Bounds for Online Scheduling
• Bounds on Multiprocessing Timing Anomalies
• Evaluation of a MULTIFIT-based scheduling algorithm
• scientific article; zbMATH DE number 1349588 (Why is no real title available?)
• New algorithms for an ancient scheduling problem.
• On-line scheduling revisited
• Performance bounds of algorithms for scheduling advertisements on a web page
• Scheduling space-sharing for internet advertising
• Tighter Bounds for the Multifit Processor Scheduling Algorithm

Cited in

(21)

• Dynamic pricing and advertising for web content providers
• Performance bounds of algorithms for scheduling advertisements on a web page
• Scheduling space-sharing for internet advertising
• New online algorithms for story scheduling in web advertising
• 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
• Optimization of column width in website layout for advertisement fit
• Approximating the advertisement placement problem
• Scheduling advertisements on a web page to maximize revenue
• Improvements to the linear programming based scheduling of web advertisements
• Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms
• A goal programming model for selection and scheduling of advertisements on online news media
• Scheduling banner advertisements on the web
• Scheduling of dynamic in-game advertising
• scientific article; zbMATH DE number 2038780 (Why is no real title available?)
• Online story scheduling in web advertising
• Generalized assignment of time-sensitive item groups
• Two-agent advertisement scheduling on physical books to maximize the total profit
• New online algorithms for story scheduling in web advertising
• Maximizing revenue with allocation of multiple advertisements on a Web banner
• The preemptive resource allocation problem

This page was built for publication: Scheduling web advertisements: a note on the minspace problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880489)