|
|||||
|
|
Hardness of lazy packing and covering |
|
| Authors: | Ling Gai |
| Affiliation: | a Department of Mathematics, Tianjin University, China b College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China |
| 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≠NP are also derived. |
| Keywords: | Bin packing Bin covering NP-hardness |
| 本文献已被 ScienceDirect 等数据库收录！ | |