Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems

DOI10.1007/11940128_57zbMATH Open1135.68643OpenAlexW1500270910MaRDI QIDQ5459151FDOQ5459151

Yang Yang, Jinhui Xu, Mingen Lin

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Recommendations

• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
• On lazy bin covering and packing problems
• On Lazy Bin Covering and Packing Problems
• Fundamentals of Computation Theory
• The maximum resource bin packing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (5)

• Tight approximations for resource constrained scheduling and bin packing
• Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
• Hardness of lazy packing and covering
• On Lazy Bin Covering and Packing Problems
• On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis

This page was built for publication: Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems

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