Parallel Approximation Algorithms for Bin Packing
Richard J. AndersonErnst W. MayrManfred K. WarmuthPublished in: Inf. Comput. (1989)
Keyphrases
- approximation algorithms
- bin packing
- np hard
- special case
- vertex cover
- approximation schemes
- graph colouring
- polynomial time approximation
- primal dual
- minimum cost
- worst case
- search tree
- packing problem
- approximation ratio
- undirected graph
- set cover
- randomized algorithms
- open shop
- precedence constraints
- linear programming
- disjoint paths
- shared memory
- approximation guarantees
- combinatorial auctions
- multi dimensional
- upper bound
- constant factor approximation