Online algorithms for 1-space bounded 2-dimensional bin packing and square packing | |
Zhang, Yong[1]; Chin, Francis Y. L.[2]; Ting, Hing-Fung[3]; Han, Xin[4]; Poon, Chung Keung[5]; Tsin, Yung H.[6]; Ye, Deshi[7] | |
2014 | |
会议名称 | 19th Annual International Computing and Combinatorics Conference (COCOON) |
会议日期 | 2014-10-16 |
关键词 | Competitive analysis Two dimensional bin packing Square packing |
页码 | 135-149 |
URL标识 | 查看原文 |
内容类型 | 会议论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/5079712 |
专题 | 河北大学 |
作者单位 | 1.[1]Hebei Univ, Coll Math & Comp Sci, Baoding, Peoples R China. 2.Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China. 3.[2]Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China. 4.[3]Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China. 5.[4]Dalian Univ Technol, Sch Software, Dalian, Peoples R China. 6.[5]City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China. 7.[6]Univ Windsor, Sch Comp Sci, Windsor, ON N9B 3P4, Canada. 8.[7]Zhejiang Univ, Coll Comp Sci, Hangzhou, Zhejiang, Peoples R China. |
推荐引用方式 GB/T 7714 | Zhang, Yong[1],Chin, Francis Y. L.[2],Ting, Hing-Fung[3],et al. Online algorithms for 1-space bounded 2-dimensional bin packing and square packing[C]. 见:19th Annual International Computing and Combinatorics Conference (COCOON). 2014-10-16. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论