On some packing problem related to dynamic storage allocation
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 22 (1988) no. 4, pp. 487-499.
@article{ITA_1988__22_4_487_0,
     author = {Chrobak, Marek and \'Slusarek, Maciej},
     title = {On some packing problem related to dynamic storage allocation},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {487--499},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {4},
     year = {1988},
     zbl = {0675.68041},
     mrnumber = {984588},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1988__22_4_487_0/}
}
TY  - JOUR
AU  - Chrobak, Marek
AU  - Ślusarek, Maciej
TI  - On some packing problem related to dynamic storage allocation
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1988
DA  - 1988///
SP  - 487
EP  - 499
VL  - 22
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1988__22_4_487_0/
UR  - https://zbmath.org/?q=an%3A0675.68041
UR  - https://www.ams.org/mathscinet-getitem?mr=984588
LA  - en
ID  - ITA_1988__22_4_487_0
ER  - 
%0 Journal Article
%A Chrobak, Marek
%A Ślusarek, Maciej
%T On some packing problem related to dynamic storage allocation
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1988
%P 487-499
%V 22
%N 4
%I EDP-Sciences
%G en
%F ITA_1988__22_4_487_0
Chrobak, Marek; Ślusarek, Maciej. On some packing problem related to dynamic storage allocation. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 22 (1988) no. 4, pp. 487-499. http://www.numdam.org/item/ITA_1988__22_4_487_0/

1. B. S. Baker, D. J. Brown and H. P. Katseff, A 5/4 Algorithm for Two-Dimensional Packing, J. Algorithms, Vol. 2, 1981, pp. 348-368. | MR | Zbl

2. B. S. Baker and E. G. Jr. Coffman, A Two-Dimensional Bin-Packing Model of Preemptive FIFO Storage Allocation, J. Algorithms, Vol. 3, 1982, pp. 303-316. | MR | Zbl

3. B. S. Baker and J. S. Schwartz, Shelf Algorithms for Two-Dimensional Packing Problems, SIAM J. Comput., Vol. 12, 1983, pp. 505-525. | MR | Zbl

4. D. J. Brown, B. S. Baker and H. P. Katseff, Lower Bounds for On-Line Two-Dimensional Packing Algorithms, Acta Informatica, Vol. 18, 1982, pp. 207-225. | MR | Zbl

5. E. G. Jr. Coffman, An Introduction to Combinatorial Models of Dynamic Storage Allocation, SIAM Review, Vol. 23, 1983, pp. 311-325. | MR | Zbl

6. E. G. Jr. Coffman, M. R. Garey and D. S. Johnson, Dynamic Bin Packing, SIAM J. Comput., Vol. 12, 1983, pp. 227-258. | MR | Zbl

7. M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979. | MR | Zbl

8. A. Gyarfás and J. Lehel, On-Line and First-Fit Colorings of Graphs, Computer and Automation Institute of the Hungarian Academy of Sciences, preprint, 1986. | MR

9. D. E. Knuth, The Art of Computer Programming, Vol.1, Fundamental Algorithms, 2nd éd., Addison-Wesley, Reading 1973. | MR | Zbl

10. J. M. Robson, Bounds for some functions concerning dynamic storage allocation, JACM, Vol. 21, 1974, pp. 491-499. | MR | Zbl

11. M. Slusarek, An off-line storage allocation algorithm, Info. Proc. Lett., Vol. 24, 1987, pp. 71-75. | MR | Zbl

12. M. Slusarek, NP-Completeness of Storage Allocation, Jagiellonian University Scientific Papers, Computer Science Series, Vol. 3, 1987, pp. 8-18. | Zbl