A polynomial time approximation algorithm for dynamic storage allocation.
Hal A. KiersteadPublished in: Discret. Math. (1991)
Keyphrases
- polynomial time approximation
- learning algorithm
- dynamic programming
- k means
- np hard
- bin packing
- objective function
- computational complexity
- detection algorithm
- optimal solution
- preprocessing
- allocation strategy
- computational cost
- dynamic allocation
- matching algorithm
- tabu search
- worst case
- search space
- similarity measure