Author:
Fernandez de la Vega W.,Lueker G. S.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest andR. E. Tarjan, Time bounds for selection,J. Comput. Sys. Sci.,7 (1973), 448–461.
2. M. R. Garey, R. L. Graham, D. S. Johnson andA. C. Yao, Multiprocessor scheduling as generalized bin-packing,J. Combinatorial Theory A21 (1976), 257–298.
3. M. R. Garey andD. S. Johnson,Computers and Intractability, Freeman, San Francisco, 1979.
4. M. R. Garey andD. S. Johnson, Approximation algorithms for bin packing problems: a survey,preprint 1980.
5. D. S. Johnson,Near optimal bin packing algorithms, Ph. D. Th., MIT, Cambridge, Mass., June 1973.
Cited by
326 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献