Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms.
Chengbin ChuRémy LaPublished in: SIAM J. Comput. (2000)
Keyphrases
- approximation algorithms
- bin packing
- worst case
- variable sized
- lower bound
- upper bound
- np hard
- search tree
- graph colouring
- average case
- minimum cost
- vertex cover
- error bounds
- greedy algorithm
- packing problem
- set cover
- primal dual
- constant factor
- approximation schemes
- open shop
- approximation ratio
- disjoint paths
- randomized algorithms
- computational complexity
- branch and bound
- np hardness
- constant factor approximation
- online algorithms
- multistage
- approximation guarantees