|
|||||
|
|
A tighter bound for FFd algorithm |
|
| Authors: | LI Rongheng Yue Minyi |
| Affiliation: | (1) Department of Mathematics, Human Normal University, 410081, Changsha, China;(2) Institute of Applied Mathematics, the Academy of Mathematics and Systems Sciences, the Chinese Academy of Sciences, 100080 Beijing, China |
| Abstract: | For the bin-packing FFD algorithm we give a proof of FFD (L)≤11/9 OPT (L)+7/9. The best bound before was FFD (L)≤11/9 OPT (L)+1 given by Yue Minyi. This project is supported by the National Natural Science Foundation of China |
| Keywords: | Binpacking FFD algorithm |
| 本文献已被 CNKI SpringerLink 等数据库收录！ | |