Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference26 articles.
1. Baker, B. S., and Schwarz, J. S., Shelf Algorithms for Two-Dimensional Packing Problems,SIAM J. Comput.,12 (1983), 508–525.
2. Bartholdi, J. J., Vande Vate, J. H., and Zhang, J., Expected Performance of the Shelf Heuristic for Two-Dimensional Packing,Oper. Res. Lett.,8 (1989), 11–16.
3. Coffman, E. G., Jr., Flatto, L., and Leighton, F. T., First-Fit Allocation of Queues: Tight Probabilistic Bounds on Wasted Space,Stochastic Process Appl.,36 (1990), 311–330.
4. Coffman, E. G., Jr., Garey, M. R., and Johnson, D. S., Dynamic Bin Packing,SIAM J. Comput.,12 (1983), 227–258.
5. Coffman, E. G., Jr., Garey, M. R., and Johnson, D. S., Approximation Algorithms for Bin Packing-An Updated Survey,Algorithm Design for Computer System Design (G. Ausiello, M. Lucertini, and P. Serafini, eds.), Springer-Verlag, New York, 1984, pp. 49–106.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Expected maximum of bridge random walks & Lévy flights;Journal of Statistical Mechanics: Theory and Experiment;2021-08-01
2. On Online Algorithms for Bin, Strip, and Box Packing, and Their Worst-Case and Average-Case Analysis;Programming and Computer Software;2019-12
3. First gap statistics of long random walks with bounded jumps;Journal of Physics A: Mathematical and Theoretical;2017-03-31
4. Bin-Packing;Encyclopedia of Operations Research and Management Science;2013
5. Record statistics for multiple random walks;Physical Review E;2012-07-18