Author:
Galambos G.,Woeginger G. J.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference8 articles.
1. Csirik, J., Imreh, B.: On the worst-case performance of the NkF bin-packing heuristic. Acta Cybernetica9, 89–105 (1989).
2. Csirik, J., Johnson, D. S.: Bounded space on-line bin packing: Best ist better than First. Proc. 2nd Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, January 1991.
3. Garey, M. R., Graham, R. L., Johnson, D. S., Yao, A. C. C.: Resource constrained scheduling as generalized bin packing. J. Comb. Th. Ser. A.21, 257–298 (1976).
4. Golomb, S.: On certain non-linear recurring sequences. American Math. Monthly70, 403–405 (1963).
5. Johnson, D. S.: Fast algorithms for bin packing. J. Comput. System Sci.8, 272–314 (1974).
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献