Approximation algorithms for extensible bin packing.
Edward G. Coffman Jr.George S. LuekerPublished in: SODA (2001)
Keyphrases
- approximation algorithms
- bin packing
- np hard
- graph colouring
- special case
- worst case
- vertex cover
- search tree
- minimum cost
- data model
- primal dual
- set cover
- approximation ratio
- randomized algorithms
- packing problem
- open shop
- constant factor approximation
- approximation schemes
- constant factor
- combinatorial auctions
- simulated annealing
- precedence constraints
- disjoint paths
- lower bound
- computational complexity