The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints.
György DósaLeah EpsteinPublished in: J. Comput. Syst. Sci. (2018)
Keyphrases
- bin packing
- cardinality constraints
- approximation ratio
- worst case
- approximation algorithms
- np hard
- greedy algorithm
- lower bound
- search algorithm
- special case
- search tree
- upper bound
- functional dependencies
- packing problem
- entity relationship
- database schema
- integrity constraints
- minimum cost
- deductive databases
- database
- greedy algorithms
- databases
- scheduling problem