On the worst-case performance of the NkF bin-packing heuristic

Most read articles by the same author(s)

• János Csirik, Two simple algorithms for bin covering , Acta Cybernetica: Vol. 14 No. 1 (1999)
• János Csirik, In Memoriam Csanád Imreh , Acta Cybernetica: Vol. 23 No. 3 (2018)
• János Csirik, J.B.G. Frenk, Heuristics for the 0-1 min-knapsack problem , Acta Cybernetica: Vol. 10 No. 1-2 (1991)
• Balázs Imreh, Magnus Steinby, Directable nondeterministic automata , Acta Cybernetica: Vol. 14 No. 1 (1999)
• Zoltán Ésik, Balázs Imreh, Subdirectly irreducible commutative automata , Acta Cybernetica: Vol. 5 No. 3 (1981)
• Zoltán Ésik, Balázs Imreh, Remarks on finite commutative automata , Acta Cybernetica: Vol. 5 No. 2 (1981)
• János Csirik, On the multidimensional vector bin packing , Acta Cybernetica: Vol. 9 No. 4 (1990)
• Edward G. Coffman, János Csirik, A classification scheme for bin packing theory , Acta Cybernetica: Vol. 18 No. 1 (2007)
• Balázs Imreh, Masami Ito, A. Pukler, On commutative asynchronous nondeterministic automata , Acta Cybernetica: Vol. 14 No. 4 (2000)
• Pál Dömösi, Balázs Imreh, On vi-products of automata , Acta Cybernetica: Vol. 6 No. 2 (1983)