Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 22, Number 4, 1988
Page(s) 487 - 499
DOI https://doi.org/10.1051/ita/1988220404871
Published online 01 February 2017
  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. [MR: 640519] [Zbl: 0472.68032] [Google Scholar]
  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. [MR: 681217] [Zbl: 0498.68043] [Google Scholar]
  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. [MR: 707409] [Zbl: 0521.68084] [Google Scholar]
  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. [MR: 687703] [Zbl: 0493.68042] [Google Scholar]
  5. 5. E. G. Jr. COFFMAN, An Introduction to Combinatorial Models of Dynamic Storage Allocation, SIAM Review, Vol. 23, 1983, pp. 311-325. [MR: 710464] [Zbl: 0521.68027] [Google Scholar]
  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. [MR: 697157] [Zbl: 0512.68050] [Google Scholar]
  7. 7. M. R. GAREY and D. S. JOHNSON, Computers and Intractability, Freeman, San Francisco, 1979. [MR: 519066] [Zbl: 0411.68039] [Google Scholar]
  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. [MR: 940831] [Google Scholar]
  9. 9. D. E. KNUTH, The Art of Computer Programming, Vol.1, Fundamental Algorithms, 2nd éd., Addison-Wesley, Reading 1973. [MR: 378456] [Zbl: 0895.68055] [Google Scholar]
  10. 10. J. M. ROBSON, Bounds for some functions concerning dynamic storage allocation, JACM, Vol. 21, 1974, pp. 491-499. [MR: 449589] [Zbl: 0285.68015] [Google Scholar]
  11. 11. M. SLUSAREK, An off-line storage allocation algorithm, Info. Proc. Lett., Vol. 24, 1987, pp. 71-75. [MR: 882635] [Zbl: 0653.68005] [Google Scholar]
  12. 12. M. SLUSAREK, NP-Completeness of Storage Allocation, Jagiellonian University Scientific Papers, Computer Science Series, Vol. 3, 1987, pp. 8-18. [Zbl: 0639.68007] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.