Fundamentals of Computation Theory

DOI10.1007/11537311zbMATH Open1122.90397OpenAlexW2491671784MaRDI QIDQ5492945FDOQ5492945

Authors: Leah Epstein, Jens S. Kohrt, Kim S. Larsen, Morten M. Pedersen, Sanne Wøhlk, Joan Boyar, Lene M. Favrholdt 

Publication date: 20 October 2006

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

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

Recommendations

• The maximum resource bin packing problem
• scientific article; zbMATH DE number 2016849
• scientific article; zbMATH DE number 2090002
• Online variable-sized bin packing
• Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Cited In (6)

• Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
• Upper bounds and algorithms for the maximum cardinality bin packing problem.
• Performance of Heuristics for a Computer Resource Allocation Problem
• Notes on inverse bin-packing problems
• The maximum resource bin packing problem

This page was built for publication: Fundamentals of Computation Theory

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