当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Online bin packing with cardinality constraints resolved
Journal of Computer and System Sciences ( IF 1.129 ) Pub Date : 2020-03-23 , DOI: 10.1016/j.jcss.2020.03.002
János Balogh; József Békési; György Dósa; Leah Epstein; Asaf Levin

Bin packing with cardinality constraints is a basic bin packing problem. In the online version with the parameter k≥2, items having sizes in (0,1] associated with them are presented one by one to be packed into unit capacity bins, such that the capacities of bins are not exceeded, and no bin receives more than k items. We resolve the online problem and prove a lower bound of 2 on the overall asymptotic competitive ratio. Additionally, we significantly improve the known lower bounds on the asymptotic competitive ratio for every specific value of k. The novelty of our constructions is based on full adaptivity that creates large gaps between item sizes. Last, we show a lower bound strictly larger than 2 on the asymptotic competitive ratio of the online 2-dimensional vector packing problem, where no such lower bound was known even for fixed high dimensions.
更新日期:2020-03-24

 

全部期刊列表>>
聚焦肿瘤,探索癌症
欢迎探索2019年最具下载量的材料科学论文
论文语言润色服务
宅家赢大奖
如何将化学应用到可持续发展目标中
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
舒伟
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
香港大学化学系刘俊治
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug