A New Upper Bound 2.5545 on 2D Online Bin Packing | |
Han, Xin; Chin, Francis Y. L.; Ting, Hing-Fung; Zhang, Guochuan; Zhang, Yong | |
刊名 | ACM TRANSACTIONS ON ALGORITHMS
![]() |
2011 | |
卷号 | 7页码:- |
关键词 | Online algorithms bin packing problems competitive ratio |
ISSN号 | 1549-6325 |
URL标识 | 查看原文 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/4840534 |
专题 | 大连理工大学 |
作者单位 | 1.Dalian Univ Technol, Software Sch, Dalian 116620, Peoples R China. 2.Univ Hong Kong, Dept Comp Sci, Pokfulam, Hong Kong, Peoples R China. 3.Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Peoples R China. |
推荐引用方式 GB/T 7714 | Han, Xin,Chin, Francis Y. L.,Ting, Hing-Fung,et al. A New Upper Bound 2.5545 on 2D Online Bin Packing[J]. ACM TRANSACTIONS ON ALGORITHMS,2011,7:-. |
APA | Han, Xin,Chin, Francis Y. L.,Ting, Hing-Fung,Zhang, Guochuan,&Zhang, Yong.(2011).A New Upper Bound 2.5545 on 2D Online Bin Packing.ACM TRANSACTIONS ON ALGORITHMS,7,-. |
MLA | Han, Xin,et al."A New Upper Bound 2.5545 on 2D Online Bin Packing".ACM TRANSACTIONS ON ALGORITHMS 7(2011):-. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论