Worst-case analysis of the FFH algorithm for online variable-sized bin packing

被引：10
|
作者：
Zhang, G
机构：
[1] Institute of Applied Mathematics, Academia Sinica, Beijing
来源：
COMPUTING | 1996年 / 56卷 / 02期
关键词：
combinatorial problems; bin packing; online algorithm; worst-case analysis;
D O I：
10.1007/BF02309343
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate and analyze the FFH algorithm proposed by Kinnersley and Langston [5]. We prove that the tight worst-case performance bound of FFH algorithm is 1.7, thereby answering a question in [5]. The case that bin sizes can be chosen is also considered.
引用
收藏
页码：165 / 172
页数：8
相关论文
共 50 条
12345