On some packing problem related to dynamic storage allocation

 Access to full text

 Full (PDF)

1. 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. Zbl0472.68032MR640519
2. 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. Zbl0498.68043MR681217
3. 3. B. S. BAKER and J. S. SCHWARTZ, Shelf Algorithms for Two-Dimensional Packing Problems, SIAM J. Comput., Vol. 12, 1983, pp. 505-525. Zbl0521.68084MR707409
4. 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. Zbl0493.68042MR687703
5. 5. E. G. Jr. COFFMAN, An Introduction to Combinatorial Models of Dynamic Storage Allocation, SIAM Review, Vol. 23, 1983, pp. 311-325. Zbl0521.68027MR710464
6. 6. E. G. Jr. COFFMAN, M. R. GAREY and D. S. JOHNSON, Dynamic Bin Packing, SIAM J. Comput., Vol. 12, 1983, pp. 227-258. Zbl0512.68050MR697157
7. 7. M. R. GAREY and D. S. JOHNSON, Computers and Intractability, Freeman, San Francisco, 1979. Zbl0411.68039MR519066
8. 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. MR940831
9. 9. D. E. KNUTH, The Art of Computer Programming, Vol.1, Fundamental Algorithms, 2nd éd., Addison-Wesley, Reading 1973. Zbl0895.68055MR378456
10. 10. J. M. ROBSON, Bounds for some functions concerning dynamic storage allocation, JACM, Vol. 21, 1974, pp. 491-499. Zbl0285.68015MR449589
11. 11. M. SLUSAREK, An off-line storage allocation algorithm, Info. Proc. Lett., Vol. 24, 1987, pp. 71-75. Zbl0653.68005MR882635
12. 12. M. SLUSAREK, NP-Completeness of Storage Allocation, Jagiellonian University Scientific Papers, Computer Science Series, Vol. 3, 1987, pp. 8-18. Zbl0639.68007

1. Maciej Ślusarek, Optimal on-line coloring of circular arc graphs