Funder
Hungarian State and the European Union
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference17 articles.
1. Balogh, J., Bekesi, J., & Galambos, G. (2012). New lower bounds for certain classes of bin packing algorithms. Theoretical Computer Science, 440–441, 1–13.
2. Balogh, J., Bekesi, J., Dosa, G., Galambos, G., & Tan Z. (2015) Lower bound for 3-batched bin packing, manuscript.
3. Bujtas, Cs, Dosa, G., Imreh, Cs, Nagy-György, J., & Tuza, Zs. (2011). The graph-bin packing problem. International Journal of Foundations of Computer Science, 22(8), 1971–1993.
4. Coffman, E. G, Jr, Garey, M., & Johnson, D. S. (1996). Approximation algorithms for bin packing: A survey. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46–93). Boston, MA: PWS Publishing Co.
5. de la Vega, W. F., & Lueker, G. S. (1981). Bin packing can be solved within $$1+\varepsilon $$ 1 + ε in linear time. Combinatorica, 1, 349–355.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献