The Class Constrained Bin Packing Problem with Applications to Video-on-Demand

DOI10.1007/11809678_46MaRDI QIDQ3591331zbMATH OpenOpenAlexFDO

Authors Eduardo C. Xavier, Flávio K. Miyazawa

Publication date 10 September 2007

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

Full work available at URL https://doi.org/10.1007/11809678_46

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• The class constrained bin packing problem with applications to video-on-demand
• scientific article; zbMATH DE number 2086257
• Tight bounds for online class-constrained packing
• scientific article; zbMATH DE number 1670546
• scientific article; zbMATH DE number 2081032

Cited in

(9)

• Polynomial time approximation schemes for class-constrained packing problems
• The class constrained bin packing problem with applications to video-on-demand
• scientific article; zbMATH DE number 1670546 (Why is no real title available?)
• scientific article; zbMATH DE number 2086257 (Why is no real title available?)
• Packing resizable items with application to video delivery over wireless networks
• On two class-constrained versions of the multiple knapsack problem
• Tight bounds for online class-constrained packing
• Packing resizable items with application to video delivery over wireless networks
• Class constrained bin covering

This page was built for publication: The Class Constrained Bin Packing Problem with Applications to Video-on-Demand

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