Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems.
Mingen LinYang YangJinhui XuPublished in: ISAAC (2006)
Keyphrases
- approximation algorithms
- bin packing
- cutting stock
- approximation schemes
- vertex cover
- np hardness
- np hard
- graph colouring
- special case
- worst case
- minimum cost
- data structure
- randomized algorithms
- network design problem
- search algorithm
- constant factor
- precedence constraints
- optimization problems
- packing problem
- resource constraints
- linear programming