Article ID: | iaor20102947 |
Volume: | 37 |
Issue: | 2 |
Start Page Number: | 89 |
End Page Number: | 92 |
Publication Date: | Mar 2009 |
Journal: | Operations Research Letters |
Authors: | Zhang Guochuan, Gai Ling |
Keywords: | packing |
We prove APX-hardness for the two problems maximum resource bin packing and lazy bin covering. Simple algorithms matching the best absolute bounds under the assumption