Packing resizable items with application to video delivery over wireless networks
From MaRDI portal
Publication:742419
DOI10.1016/j.tcs.2013.12.009zbMath1360.68897OpenAlexW2168455829MaRDI QIDQ742419
Sivan Albagli-Kim, Leah Epstein, Tami Tamir, Hadas Shachnai
Publication date: 18 September 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.009
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering a polygonal region by rectangles
- Maximizing the total profit of rectangles packed into a rectangle
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Scheduling with Deadlines and Loss Functions
- Saving space by algebraization
- On a dual version of the one-dimensional bin packing problem
- Probabilistic analysis of algorithms for dual bin packing problems
- An algorithm for covering polygons with rectangles
- A simple on-line bin-packing algorithm
- Approximate Algorithms for the 0/1 Knapsack Problem
- Covering Regions by Rectangles
This page was built for publication: Packing resizable items with application to video delivery over wireless networks