A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics

Published:2023-11-29 Issue:6 Volume:52 Page:1369-1412
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Nederlof Jesper¹^ORCID,Pawlewicz Jakub²,Swennenhuis Céline M. F.³^ORCID,Węgrzycki Karol⁴

Affiliation:

1. Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands.

2. IDEAS NCBR and Institute of Informatics, Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw, Warsaw, Poland.

3. Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.

4. Saarland University and Max-Planck-Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany.

Funder

Netherlands Orginization for Scientific Research

European Research Council

Fundacja na rzecz Nauki Polskiej

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Reference43 articles.

1. LIPIcs 132;Abboud A.,2019

2. LIPIcs 30;Austrin P.,2015

3. LIPIcs 47;Austrin P.,2016

4. Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs

5. Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP