On Lazy Bin Covering and Packing Problems

DOI10.1007/11809678_36MaRDI QIDQ3591310zbMATH OpenOpenAlexFDO

Authors 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) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• On lazy bin covering and packing problems
• 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
• Hardness of lazy packing and covering
• Bin covering with cardinality constraints

Cited in

(5)

• Hardness of lazy packing and covering
• On lazy bin covering and packing problems
• 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
• Asymptotic fully polynomial approximation schemes for variants of open-end bin packing

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

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