A polynomial time approximation algorithm for dynamic storage allocation
- Kierstead, H.A.
Publication date
April 1991
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
AbstractWe use an on-line algorithm for coloring interval graphs to construct a polynomial time approximation algorithm WIC for Dynamic Storage Allocation. The performance ratio for WIC is at most six; the best previous upper bound on the performance ratio for a polynomial time approximation algorithm for Dynamic Storage Allocation had been 80
Add to ORKG