Improved approximation guarantees for advertisement placement
From MaRDI portal
Cites work
- A (5/3+)-approximation for strip packing
- A near-optimal solution to a two-dimensional cutting stock problem
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem
- A PTAS for unsplittable flow on a path
- A structural lemma in 2-dimensional packing, and its implications on approximability
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- Approximating Geometric Knapsack via L-packings
- Approximating the advertisement placement problem
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation algorithms for the MAXSPACE advertisement problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- Bin packing can be solved within 1+epsilon in linear time
- Bin packing with divisible item sizes
- Bounds on Multiprocessing Timing Anomalies
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Fast Approximation Algorithms for Knapsack Problems
- scientific article; zbMATH DE number 2038780 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Improved approximation algorithm for two-dimensional bin packing
- Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
- Improved approximation algorithms for unsplittable flow on a path with time windows
- Improved approximations for vector bin packing via iterative randomized rounding
- On the approximability of unsplittable flow on a path with time windows
- Rectangle packing with one-dimensional resource augmentation
- Scheduling space-sharing for internet advertising
- Smart-grid electricity allocation via strip packing with slicing
This page was built for publication: Improved approximation guarantees for advertisement placement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346837)
