Improved approximation algorithms for minimum-space advertisement scheduling

DOI10.1007/3-540-45061-0_87MaRDI QIDQ4449247zbMATH OpenFDO

Authors Brian C. Dean, Michel X. Goemans

Publication date 8 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27191138.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Approximating the advertisement placement problem
• Approximating the advertisement placement problem
• Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms
• Scheduling web advertisements: a note on the minspace problem
• Performance bounds of algorithms for scheduling advertisements on a web page

Cited in

(10)

• Performance bounds of algorithms for scheduling advertisements on a web page
• Scheduling space-sharing for internet advertising
• A polynomial-time approximation scheme for the MAXSPACE advertisement problem
• Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms
• Algorithms and complexity for scheduling and packing problems
• Approximating the advertisement placement problem
• Two-agent advertisement scheduling on physical books to maximize the total profit
• Approximation algorithms for the MAXSPACE advertisement problem
• Local-search based heuristics for advertisement scheduling
• Improved approximation guarantees for advertisement placement

This page was built for publication: Improved approximation algorithms for minimum-space advertisement scheduling

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