| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142972 | Operations Research Letters | 2009 | 4 Pages |
Abstract
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 P≠NPP≠NP are also derived.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ling Gai, Guochuan Zhang,