Linear time-approximation algorithms for bin packing.
Guochuan ZhangXiaoqiang CaiC. K. WongPublished in: Oper. Res. Lett. (2000)
Keyphrases
- approximation algorithms
- bin packing
- worst case
- np hard
- special case
- vertex cover
- graph colouring
- open shop
- search tree
- approximation schemes
- minimum cost
- lower bound
- packing problem
- set cover
- constant factor
- upper bound
- approximation ratio
- primal dual
- randomized algorithms
- greedy algorithm
- branch and bound algorithm
- undirected graph
- precedence constraints
- combinatorial auctions
- computational complexity