A polynomial time approximation algorithm for dynamic storage allocation
- 19 April 1991
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 88 (2-3) , 231-237
- https://doi.org/10.1016/0012-365x(91)90011-p
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Intersection Theorems for t-Valued FunctionsEuropean Journal of Combinatorics, 1988
- The Linearity of First-Fit Coloring of Interval GraphsSIAM Journal on Discrete Mathematics, 1988
- On‐line and first fit colorings of graphsJournal of Graph Theory, 1988
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- On Woodall's interval problemJournal of Combinatorial Theory, Series A, 1976
- The Bay Restaurant--A Linear Storage ProblemThe American Mathematical Monthly, 1974
- An Estimate of the Store Size Necessary for Dynamic Storage AllocationJournal of the ACM, 1971