Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms

MaRDI QIDQ2741488zbMATH OpenFDO

Authors Subodha Kumar, Milind Dawande, Chelliah Sriskandarajah

Publication date 24 October 2001

zbMATH Keywords

approximation algorithmsMAXSPACEMINSPACE

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Recommendations

• Approximating the advertisement placement problem
• Performance bounds of algorithms for scheduling advertisements on a web page
• Scheduling web advertisements: a note on the minspace problem
• Approximating the advertisement placement problem
• Improved approximation algorithms for minimum-space advertisement scheduling

Cites work

• Performance bounds of algorithms for scheduling advertisements on a web page
• Scheduling space-sharing for internet advertising

Cited in

(7)

• Performance bounds of algorithms for scheduling advertisements on a web page
• Scheduling space-sharing for internet advertising
• Approximating the advertisement placement problem
• Scheduling advertisements on a web page to maximize revenue
• Scheduling banner advertisements on the web
• Improved approximation algorithms for minimum-space advertisement scheduling
• Scheduling web advertisements: a note on the minspace problem

This page was built for publication: Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms

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