On Lazy Bin Covering and Packing Problems

DOI10.1007/11809678_36zbMath1162.68460OpenAlexW1562033891MaRDI QIDQ3591310

Mingen Lin, Yang Yang, Jinhui Xu

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_36

Mathematics Subject Classification ID

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

Related Items (3)

Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems ⋮ Asymptotic fully polynomial approximation schemes for variants of open-end bin packing ⋮ Hardness of lazy packing and covering

This page was built for publication: On Lazy Bin Covering and Packing Problems