Opt versus load in dynamic storage allocation

SIAM Journal on Computing

Volumn 33, Issue 3, 2004, Pages 632-646

  Buchsbaum, Adam L ^a   Karloff, Howard ^a   Kenyon, Claire ^b   Reingold, Nick ^a   Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Approximation algorithms; Dynamic storage allocation; Polynomial time approximation schemes

Indexed keywords

APPROXIMATION ALGORITHM; DYNAMIC STORAGE ALLOCATION; MEMORY REQUESTS; POLYNOMIAL-TIME APPROXIMATION SCHEMES;

ALGORITHMS; GRAPH THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

STORAGE ALLOCATION (COMPUTER);

EID: 3142675188     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703423941     Document Type: Article

References (8)

1. M. CHROBAK AND M. SLUSAREK, On some packing problem related to dynamic storage allocation, RAIRO Inform. Theor. Appl., 22 (1988), pp. 487-499.
2. M. DE BERG, M. VAN KREVALD, M. OVERMARS, AND O. SCHWARZKOPF, Computational Geometry: Algorithms and Applications, 2nd ed., Springer-Verlag, Berlin, 2000.
3. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.
4. J. GERGOV, Approximation algorithms for dynamic storage allocation, in Algorithms - ESA 1996, Lecture Notes in Comput. Sci. 1136, J. Diaz and M. J. Serna, eds., Springer-Verlag, Berlin, 1996, pp. 52-61.
5. J. GERGOV, Algorithms for compile-time memory optimization, in Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, SIAM, Philadelphia, 1999, pp. 907-908.
6. H. A. KIERSTEAD, The linearity of first-fit coloring of interval graphs, SIAM J. Discrete Math., 1 (1988), pp. 526-530.
7. H. A. KIERSTEAD, A polynomial time approximation algorithm for dynamic storage allocation, Discrete Math., 88 (1991), pp. 231-237.
8. D. R. WOODALL, Problem no. 4, in Proceedings of the British Combinatorial Conference (1973), London Math. Soc. Lecture Note. Ser. 13, Cambridge University Press, Cambridge, UK, 1974, p. 202.