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

DOI10.1007/11940128_57zbMath1135.68643OpenAlexW1500270910MaRDI QIDQ5459151

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

Mathematics Subject Classification ID

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

Related Items (2)

Asymptotic fully polynomial approximation schemes for variants of open-end bin packing ⋮ Hardness of lazy packing and covering

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