Packing resizable items with application to video delivery over wireless networks
type: Item
instance of: scholarly article
title: Packing resizable items with application to video delivery over wireless networks
zbMATH Open document ID: 1360.68897
author: Sivan Albagli-Kim
author: Leah Epstein
author: Hadas Shachnai
author: Tami Tamir
published in: Theoretical Computer Science
publication date: 2014-09-18T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6345746
zbMATH Keywords: packing
zbMATH Keywords: approximation algorithms
zbMATH Keywords: variable quality-of-service
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.tcs.2013.12.009
OpenAlex ID: W2168455829
cites work: On a dual version of the one-dimensional bin packing problem
cites work: Covering Regions by Rectangles
cites work: Q4952619
cites work: Probabilistic analysis of algorithms for dual bin packing problems
cites work: Better approximation algorithms for bin covering
cites work: An algorithm for covering polygons with rectangles
cites work: Q4198056
cites work: An asymptotic fully polynomial time approximation scheme for bin covering.
cites work: Maximizing the total profit of rectangles packed into a rectangle
cites work: Q4821303
cites work: Q4228435
cites work: A simple on-line bin-packing algorithm
cites work: Saving space by algebraization
cites work: Scheduling with deadlines and loss functions
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: Covering a polygonal region by rectangles
cites work: Q4251632
DOI: 10.1016/J.TCS.2013.12.009
description: scientific article; zbMATH DE number 6345746