Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Better approximation algorithms for bin covering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Lazy Bureaucrat scheduling problem
Information and Computation
The maximum resource bin packing problem
Theoretical Computer Science
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
Information Processing Letters
On lazy bin covering and packing problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On Lazy Bin Covering and Packing problems
Theoretical Computer Science
The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
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 PNP are also derived.