Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems.
Mingen LinYang YangJinhui XuPublished in: Algorithmica (2010)
Keyphrases
- approximation algorithms
- bin packing
- vertex cover
- cutting stock
- approximation schemes
- graph colouring
- np hardness
- np hard
- special case
- randomized algorithms
- network design problem
- worst case
- packing problem
- constant factor
- np complete
- minimum cost
- lot sizing
- resource constraints
- combinatorial optimization
- approximation ratio
- polynomial time approximation
- resource allocation
- open shop