Approximation algorithms for the MAXSPACE advertisement problem
From MaRDI portal
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- scientific article; zbMATH DE number 2038780 (Why is no real title available?)
- scientific article; zbMATH DE number 2086937 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Performance bounds of algorithms for scheduling advertisements on a web page
- Scheduling space-sharing for internet advertising
Cited in
(2)
This page was built for publication: Approximation algorithms for the MAXSPACE advertisement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580082)