Author:
Coffman E. G.,Lueker George S.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference10 articles.
1. Alon, N., Y. Azar, G. J. Woeginger, and T. Yadid, “Approximation schemes for scheduling on parallel machines,” Journal of Scheduling, 1, 55–66 (1998).
2. Coffman, Jr., E. G. and G. S. Lueker, “Approximation algorithms for extensible bin packing,” in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 586–588.
3. Dell'Olmo, P., H. Kellerer, M. G. Speranza, and Z. Tuza, “A 13/12 approximation algorithm for bin packing with extendable bins,” Information Processing Letters, 65, 229–233 (1998).
4. Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
5. Grötschel M., L. Lovász, and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,” Combinatorica, 1(2), 169–197 (1981).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献